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

clear
2140 of 164 problems
  • Erdős Problem #397Paul Erdős, Ronald Graham, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • Erdős Problem #897Paul Erdős, 1972

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • Erdős asked whether every n-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least (1+o(1))n^2. Disproved: an explicit high-dimensional construction beats the conjectured constant.

    disproved

    1 attempt · machine-checked by Lean

  • Erdős Problem #1197Paul Erdős, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    disproved

    1 attempt · machine-checked by Lean

  • Schiffer's Conjecture and the Pompeiu ProblemD. Pompeiu (1929); reformulated via Neumann eigenfunctions by M. M. Schiffer (1957), 1929

    If a smooth bounded domain in R^n admits a Neumann eigenfunction of the Laplacian that is constant on the boundary, must the domain be a ball? Pompeiu posed an equivalent integral-equation form in 1929; Schiffer's 1957 reformulation via…

    disproved

    1 attempt · machine-checked by Lean

  • Araujo, Piga and Schacht asked whether density and codegree both above 1/4 force a tight Hamilton cycle in a linearly quasirandom 3-graph. No: the threshold is p_0 = max_0 ≤ x ≤ 1minx^3, 1-x ≈ 0.3177, and below it there are dense 3-graphs…

    disproved

    1 attempt

  • Han and Jiang asked whether being of klt type is an open condition in flat families of varieties. It is not.

    disproved

    1 attempt

  • The low-degree conjecture predicts that when the low-degree advantage between a planted distribution and a uniform null distribution stays bounded, no polynomial-time algorithm can distinguish them. It is false. There is a planted…

    disproved

    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

  • 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

  • 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

  • Let S(x) count ordered pairs (a,b) with a+b ≤ x and σ(a)+σ(b) = σ(a+b). Erdos asked whether S(x) ~ cx. The opposite extreme holds: for every R > 0, S(x)/(x(log x)^R) → ∞, so the count beats every fixed logarithmic scale.

    disproved

    1 attempt

  • Convergence of Three-Block ADMM with Identity Third BlockOpen subclass left by Chen, He, Ye, Yuan (2016), 2016

    After Chen-He-Ye-Yuan's counterexample to direct three-block ADMM, the subclass in which the third constraint block is the identity matrix remained unresolved: the literature contained neither a convergence proof nor a counterexample.…

    disproved

    1 attempt

  • Reading computed the order dimension of the poset of regions for most finite Coxeter arrangements, observed that an exceptional type whose dimension exceeds its rank would be the first known simplicial arrangement with that property, and…

    disproved

    1 attempt

  • HRT ConjectureChristopher Heil, Jayakumar Ramanathan, Pankaj Topiwala, 1996

    Heil, Ramanathan and Topiwala conjectured in 1996 that any finite set of time-frequency shifts of a nonzero square-integrable function is linearly independent. This refutes it: there is a Schwartz function admitting 12 linearly dependent…

    disproved

    1 attempt

  • Mossel-Peres Multivariable Bernoulli Factory ClaimElchanan Mossel, Yuval Peres, 2005

    Mossel and Peres showed that a single-variable function admits a finite-automata Bernoulli factory exactly when it is rational, and their Theorem 2.9 claimed the same extension to multivariable functions. The multivariable claim is false,…

    disproved

    1 attempt

  • Gaussian Completely Monotone ConjectureFan Cheng & Yanlin Geng, 2015

    Along the heat flow, do the successive time derivatives of the entropy of X + √t Z alternate in sign, as conjectured by Cheng and Geng? An explicit measure on R has a fifth derivative with the forbidden sign.

    disproved

    1 attempt

  • The Jauslin-Kreiss-Moser Vanishing-Viscosity Selection ProblemHans R. Jauslin, Heinz-Otto Kreiss, Jurgen Moser, 1999

    For the ergodic problem tfrac12|Dφ^ε|^2 + F(x) - εΔφ^ε = c(ε) on the torus, normalized by φ^ε(0) = 0, Jauslin, Kreiss and Moser asked whether the vanishing-viscosity limit lim_ε → 0φ^ε always exists. It need not: there is a one-dimensional…

    disproved

    1 attempt

  • The near-quadratic Elekes-Ronyai expander conjecture over R predicts that a nonspecial polynomial expands any finite set to near-quadratic size. False: a fixed nonspecial quadratic polynomial, together with arbitrarily large finite sets of…

    disproved

    1 attempt