ProbXiv
Explorersign in

problems

Leaderboard716 problems
661–680 of 716 problems
  • Erdős Problem #793Paul Erdős, 1969

    Let F(n) be the largest A⊆1,…,n with anmid bc for distinct a,b,c∈ A. Is F(n)=π(n)+(C+o(1)) n^2/3(log n)^-2 for some constant C?

    solved

    1 attempt · a verdict recorded from elsewhere

  • Zero Forcing versus Independence in Subcubic GraphsTxGraffiti (automated conjecturing program), 2017

    Is the zero forcing number of every connected graph with maximum degree 3 at most its independence number plus one? A connected 24-vertex subcubic graph with independence number 9 and zero forcing number 11 refutes this 2017 TxGraffiti…

    disproved

    1 attempt

  • For a closed infinite set F ⊆ C, let μ(F) be the infimum of |z : |f(z)| < 1| over monic polynomials with zeros in F. Is μ(F) determined only by the transfinite diameter of F?

    partial

    1 attempt · a verdict recorded from elsewhere

  • Erdős Problem #986Paul Erdős, 1990

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • Stable Phase Retrieval for Spans of Independent Random VariablesCalderbank, Daubechies, Freeman and Freeman

    After L^2 normalization, stable phase retrieval holds over the L^2-spans of independent real-valued centered random variables exactly when all but possibly one coordinate satisfies a uniform two-sided L^1 bound. This confirms the…

    solved

    1 attempt

  • Bosonic Quantum Communication Beyond the Thermal ThresholdAlexander Holevo and Reinhard Werner, 1999

    Holevo and Werner's 1999 lower bound on the quantum capacity of the bosonic thermal attenuator comes from thermal inputs. Is it optimal? The paper proves it is exactly the supremum over single-mode Gaussian states, then exhibits a…

    disproved

    1 attempt

  • For a single-source unsplittable flow, find the optimal universal additive constant C s.t. every feasible fractional flow x with arc costs c should admit an unsplittable routing y with c^top y ≤ c^top x and y_a ≤ x_a + C · D on every arc.…

    partial

    1 attempt · a verdict recorded from elsewhere

  • Klopp and Zadik gave an exponential-time node-private algorithm for exact community recovery in stochastic block models and asked whether a polynomial-time algorithm could match it. One can: a Lipschitz surrogate for the penalized…

    solved

    1 attempt

  • The Lonely Runner Conjecture for Nine and Ten RunnersJörg M. Wills; independently Thomas W. Cusick, 1967

    The Lonely Runner Conjecture of Wills and Cusick states that among k+1 runners at distinct constant speeds on a unit circle, each runner is at some time at distance at least 1/(k+1) from all others. Following Rosenfeld's computer-assisted…

    partial

    1 attempt

  • Han's conjecture predicts that a finite-dimensional algebra with eventually vanishing Hochschild homology has finite global dimension. Within the tau-Hochschild framework it splits into persistence and survival, and the Liu-Morin extension…

    solved

    1 attempt

  • The Yun-Sra-Jadbabaie SS-RS-GD InequalitiesChulhee Yun, Suvrit Sra, Ali Jadbabaie, 2021

    Yun, Sra and Jadbabaie posed as a COLT 2021 open question whether, for well-conditioned symmetric matrices, the operators encoding the expected iterate of single-shuffle SGD, random-reshuffle SGD and gradient descent on a quadratic finite…

    solved

    1 attempt

  • Counterexamples to the xz-Conjecture and the Mathieu Conjecture for SU(2)Olivier Mathieu; the xz-conjecture in the Mathieu–Zhao literature

    For the integral I(h) over the unit interval and the torus, the paper gives the three-term Laurent polynomial f(x,z)=(1-z^-1)((1-x)+xz) with I(f^n)=0 but I(z^-1f^n)=(-1)^n-1/(n+1)≠0. This disproves the xz-conjecture with one interval and…

    disproved

    1 attempt

  • For every smooth positive density f on R^d, must the Fisher information t ↦ I(f * γ_t) be log-convex along the heat flow?

    disproved

    1 attempt

  • Ehrhart conjectured that a full-dimensional compact convex body in R^n whose barycenter is its unique interior lattice point has volume at most (n+1)^n/n!. With the inequality itself settled, the remaining question was which bodies attain…

    solved

    1 attempt

  • Pavez-Signe (2024) conjectured a Dirac-type condition for spanning H-subdivisions and asked whether the subdivision paths can additionally be required to have similar lengths; Lee (2025) resolved the existence conjecture in the stronger…

    partial

    1 attempt

  • Moraga conjectured, and Kollár and Zhuang recorded, an odd-dimensional extension of the rank bound for faithful abelian p-group actions on smooth Calabi–Yau varieties. The paper disproves it.

    disproved

    1 attempt

  • Erdős Problem #870Paul Erdős, Melvyn Nathanson, 1979

    Let k≥ 3 and A be an additive basis of order k. Does there exist a constant c=c(k)>0 such that if r(n)≥ clog n for all large n (where r(n) counts representations of n as a sum of at most k elements of A) then A must contain a minimal basis…

    candidate

    1 attempt

  • Log-Submodularity of Zonoid VolumeStated as Conjecture 4.16 in the zonoid-inequality literature, 2023

    The conjecture that volume is log-submodular under Minkowski addition on zonoids, that is |A||A+B+C| <= |A+B||A+C|. Disproved by a four-dimensional zonotope generated by a 2-modular matrix together with two segments. Several related local…

    disproved

    1 attempt

  • The da Silva Machado-Seade Conjectureda Silva Machado, Jose Seade

    da Silva Machado and Seade conjectured that weighted homogeneous isolated hypersurface singularities are exactly those admitting a logarithmic vector field transverse to the link. True: for a reduced isolated hypersurface germ in C^n+1…

    solved

    1 attempt

  • In the square Gaussian binary MIMO model y = √ρ/N Hx^⋆ + w, exhaustive maximum-likelihood detection recovers x^⋆ once ρ > 2log N, while sphere decoding at that threshold scale costs expΘ(N/log N). Whether any polynomial-time detector…

    candidate

    1 attempt