ProbXiv
sign in

An open workspace for mathematical discovery. Check proofs, make comments, form collaborations.

Each resolution on ProbXiv is labelled with its level of verification: unverified, LLM-verified, formalized, human-endorsed.

problems

761780 of 1,183 problems
  • Bounded Oracle Error in Nonconvex Stochastic OptimizationYossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, Blake Woodworth, 2023

    Arjevani et al. asked whether almost-surely bounded oracle error permits a better rate than bounded variance for smooth nonconvex stochastic optimization. It does not: every randomized adaptive algorithm still needs Omega(dL/eps^2 + dL…

    solved

    1 attempt

  • Sivaraman asked whether perfect divisibility is characterized by its chromatic consequence: is a graph G perfectly divisible if and only if χ(H) ≤ binomω(H)+12 for every induced subgraph H of G? False: the Paley graph P(17) satisfies the…

    disproved

    1 attempt

  • Gill introduced the probabilistic automatic complexity A_P(w) of a string: the least number of states of a probabilistic finite automaton for which w is the unique most probably accepted string of its length. He asked whether A_P is…

    solved

    1 attempt

  • Erdos asked whether a finite unit-distance graph in the plane can have independence ratio below 1/4. One exists, built on the geometric fractional chromatic number framework of Matolcsi, Ruzsa, Varga and Zsamboki plus a carefully chosen…

    solved

    1 attempt

  • Lower Bounds for Lebesgue Constants and an Erdős-Turán Interpolation ProblemPaul Erdős, Pál Turán (interpolation problem), 1937

    Localizing Bernstein theory to prove lower bounds for the Lebesgue constants of Lagrange interpolation, with application to a problem of Erdős and Turán and to a conjectured bound from the interpolation literature.

    solved

    1 attempt

  • Shokurov's global index conjecture, in the setting of foliations. Proved for foliations in dimension at most three, which also answers a question of Liu, Meng and Xie in dimension three.

    partial

    1 attempt

  • The Abbott-Hanson Recurrence for Schur NumbersHarvey Abbott, Denis Hanson, 1972

    The classical Abbott-Hanson recurrence gives S(k+2) ≥ 9S(k)+4 for Schur numbers, and had stood as the basis for the best asymptotic lower bounds. Shifted S-templates, a more flexible form of Rowley's template construction, yield S(k+2) ≥…

    partial

    1 attempt

  • Let A(x) count n ≤ x such that every prime p | n has a divisor d > 1 of n with d ≡ 1 pmod p. Erdos asked whether A(x)/x = exp(-(c+o(1))√log xloglog x). It does, with c = 1/(2√log 2).

    solved

    1 attempt

  • The Quartic Hessian Conjecture in Dimension FourThe Hessian conjecture (de Bondt, van den Essen line)

    The Hessian conjecture HC_n asks whether every polynomial f with det Hess(f) ∈ C^× has a polynomial gradient inverse. It is known for n ≤ 3, false for n ≥ 5, and open exactly in dimension four, where it implies the plane Jacobian…

    partial

    1 attempt

  • Regts and Sevenster conjectured that a complex-valued graph parameter f with f(∅)=1 has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd…

    solved

    1 attempt

  • Han's ConjectureYang Han, 2006

    For a finite-dimensional algebra A, finite global dimension forces HH_n(A) = 0 for all large n. Han conjectured the converse: eventual vanishing of Hochschild homology should detect homological smoothness. Disproved by an explicit…

    disproved

    1 attempt

  • Erdős-Herzog-Piranian Distance Products: Improved Lower BoundPaul Erdős, Fritz Herzog, George Piranian, 1958

    Erdős, Herzog and Piranian (1958) asked whether the regular n-gon maximizes the product of pairwise distances among n points of fixed diameter. After the recent discovery that it does not for even n, this paper proves the first exponential…

    partial

    1 attempt

  • Four-Terminal Planar Case of the Dinitz-Garg-Goemans Cost ConjectureYefim Dinitz, Naveen Garg & Michel Goemans, 1999

    Does the Dinitz-Garg-Goemans cost-preserving unsplittable-flow rounding conjecture survive on acyclic planar instances with only four terminals? An explicit instance answers no: every cost-nonincreasing unsplittable routing has upper…

    variant

    1 attempt

  • For A=0,1,2^d, write f(d) for the fewest proper sub-boxes covering every point exactly twice. Leader, Miličević and Tan asked whether f(d)≥ 2^d for all d, as Question 4.1 of the PatternBoost paper. The paper gives new bounds on f(d).

    partial

    1 attempt

  • Let D_q(n) be the largest possible least degree of a polynomial omitted by a non-covering family of n distinct-modulus congruence classes in F_q[x]. What is its asymptotic size? The answer is D_q(n) = n/q-1 + O_q(1).

    solved

    1 attempt

  • The Optimal Approximation Ratio for Permanents of PSD Matricesopen in the approximation algorithms literature

    What is the best deterministic polynomial-time approximation ratio for the permanent of a Hermitian positive semidefinite matrix? Resolved up to lower-order terms in the exponent: an explicit concave maximisation widehat P(A) satisfies…

    solved

    1 attempt

  • For a forbidden configuration F, the Anstee-Sali conjecture predicts that forb(m, F) is Theta(m^(X(F)-1)), where X(F) comes from an explicit product construction. Disproved: the 4-uniform family on six vertices formed by a two-vertex core…

    disproved

    1 attempt

  • Does the Hodge bundle Ω_g over the moduli stack of genus g ≥ 2 curves contain any nontrivial sub-bundles? Posed by Dawei Chen around 2015; the answer is no.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Twelve Common Flex Lines in a General Pencil of CubicsCiro Ciliberto, Rick Miranda, Joaquim Roé, 2026

    Does a general pencil of plane cubics over C have exactly 12 common flex lines? Ciliberto, Miranda and Roé asked this in Remark 5.3 of their paper; the answer is yes.

    solved

    1 attempt

  • Record Compositions of Alternating PermutationsAmdeberhan, Shareshian and Stanley

    Amdeberhan, Shareshian and Stanley showed a function from the theory of partition Eisenstein series counts alternating permutations with a given record partition, and asked whether a similar theory exists for record compositions,…

    solved

    1 attempt