ProbXiv
Explorersign in

problems

Leaderboard716 problems
581–600 of 716 problems
  • For a Brauer class on a variety, the period-index conjecture bounds the index in terms of the period and the dimension. Disproved: for any uncountable algebraically closed field k of characteristic 0 and any d ≥ 3 there is a d-dimensional…

    disproved

    1 attempt

  • The Ciliberto et al. Question on Effective Divisors of Positive Self-IntersectionCiro Ciliberto, Andreas Leopold Knutsen, John Lesieutre, Victor Lozovanu, Rick Miranda, Yusuf Mustopa, Damiano Testa

    Ciliberto, Knutsen, Lesieutre, Lozovanu, Miranda, Mustopa and Testa asked a question about effective divisors of positive self-intersection on smooth projective surfaces. The answer is negative, witnessed by a very non-movable effective…

    disproved

    1 attempt

  • Thiele Rules on the Voter Interval DomainEdith Elkind, Martin Lackner, 2015

    A polynomial-time algorithm for computing an optimal committee under any Thiele voting rule on the Voter Interval domain, resolving a ten-year-old open problem posed for Proportional Approval Voting by Elkind and Lackner and later extended…

    solved

    1 attempt

  • Does the analytic Bertini restriction theorem for multiplier ideals hold locally, outside a pluripolar exceptional set of fibers? Proved in full generality.

    solved

    1 attempt

  • Petersen Coloring ConjectureFrançois Jaeger, 1985

    Jaeger conjectured that every bridgeless cubic graph G admits a Petersen coloring: a map φcolon E(G)→ E(P) into the edges of the Petersen graph P such that, for every vertex v of G, the three edges at v are sent to three edges meeting at a…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Simonovits conjectured that if a forbidden family F with p(F) > 1 has extremal number exceeding the Turan bound by a superlinear surplus, then its extremal graphs are joins of p graphs, each extremal for a family of chromatic number two.…

    disproved

    1 attempt

  • The BCHM theorem makes the log canonical ring of a projective klt pair finitely generated. Generalized pairs, introduced by Birkar and Zhang, add an auxiliary nef part and have become a central tool in birational geometry, so it is natural…

    disproved

    1 attempt

  • New upper and lower bounds on the approximation ratio achievable for Multiway Cut via large mixtures of new and old rounding schemes for the CKR relaxation, advancing the ratio ladder that has run since Călinescu-Karloff-Rabani (1998).

    partial

    1 attempt

  • What is the minimax optimal error rate for density estimation when observations are perturbed by Wasserstein-bounded contaminations? Chao and Dobriban's 2023 preprint left a gap between upper and lower bounds; the sharp rate is now…

    solved

    1 attempt

  • A group is Howson if the intersection of any two finitely generated subgroups is finitely generated, and strongly Howson if the rank of that intersection is bounded in terms of the two ranks. Zhang asked whether the two coincide for…

    disproved

    1 attempt

  • Baumslag asked whether a one-relator group G=F/⟨⟨ r⟩⟩ with r a commutator is Hopfian, residually finite or automatic. The paper constructs a family G_m=⟨ a,t | [t,a[a,t]^-m]⟩ answering all three negatively.

    disproved

    1 attempt

  • North-East Lattice Paths with Few Collinear VerticesJoseph L. Gerver, L. Thomas Ramsey, 1979

    Let A(k) be the largest possible number of moves in a north-east lattice path whose visited vertices contain no k collinear points. Gerver (1979) and Gerver and Ramsey (1979) bounded A(k) by exp(Ω(log(k)^2)) ≤ A(k) ≤ exp(O(k^4)), and…

    partial

    1 attempt

  • Growth Constants for Lipschitz Functions on Sparse Random GraphsSamuel Korsky, Saffat Saffat, Dhroova Aiylam

    Korsky, Saffat and Aiylam bounded the growth constant c(G) for integer-valued Lipschitz functions on G(n,d/n) between 1/(2d) and 4log^2 d/d up to lower-order terms. The random-graph side is sharpened.

    partial

    1 attempt

  • Levit–Mandrescu Unimodality ConjectureVadim E. Levit, Eugen Mandrescu, 2006

    A graph on n vertices is very well-covered if every maximal independent set has size n/2. Levit and Mandrescu conjectured that the independence polynomial i(G,x) of every very well-covered graph is unimodal, i.e. its coefficient sequence…

    disproved

    1 attempt

  • Problem MAIS-O60: Single-Neuron Fourier AlignmentClaude Fable 5 (directed by Lionel Levine), 2026

    Does a single ReLU neuron trained on modular addition align to one Fourier frequency? Open Problem MAIS-O60, itself posed by Claude Fable 5 under the direction of Lionel Levine, is answered negatively: an explicit construction reaches a…

    disproved

    1 attempt

  • Local Cohomology Modules With Nonclosed SupportCraig Huneke and Gennady Lyubeznik

    Can a noetherian ring have a local cohomology module whose support is not closed - equivalently, one with infinitely many minimal primes? Huneke and Lyubeznik asked; the paper constructs such rings, so the answer is yes.

    solved

    1 attempt

  • An asymptotic formula for p(k), the limiting probability that a random permutation has an invariant set of size k: it is asymptotically k^-δ(1+o(1)) times a smooth positive function, sharpening a line of estimates running through…

    solved

    1 attempt

  • Jacobian ConjectureOtt-Heinrich Keller, 1939

    Every polynomial map C^n → C^n with constant nonzero Jacobian determinant is invertible, with a polynomial inverse.

    disproved

    1 attempt · a verdict recorded from elsewhere

  • Sharpness of Denjoy's TheoremMichael Herman, 1979

    Denjoy's 1932 theorem says a C^1+bv circle diffeomorphism with irrational rotation number has no wandering interval. Whether it is sharp in regularity: for every concave modulus of continuity ω weaker than Lipschitz, there is a C^1+ω…

    solved

    1 attempt

  • The Classical Smith-Ward ProblemR. R. Smith, J. D. Ward

    The Smith-Ward theorem realizes the first k essential matrix ranges of an operator as the matrix ranges of a compact perturbation. The classical Smith-Ward problem asks whether that perturbation can be chosen independently of k,…

    disproved

    1 attempt