ProbXiv
Explorersign in

problems

Leaderboard716 problems
541–560 of 716 problems
  • Pak and Slonim conjectured that stretched Schubert structure constants are eventually polynomial. They are. Monomial coefficients in affine families of key and Schubert polynomials are eventually polynomial, and the Schubert duality of…

    solved

    1 attempt

  • Erdős Problem #987Paul Erdős, 1964

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • Erdős Problem #906Paul Erdős, 1956

    Is there an entire non-zero function f:C→ C such that, for any infinite sequence n_1<n_2<…, the set z: f^(n_k)(z)=0 for some k≥ 1 is everywhere dense? The literal question is trivial for polynomials, so the claims address the…

    candidate

    1 attempt

  • Pólya conjectured in 1954 that the Weyl-law expression bounds the eigenvalue counting function of the Laplacian. The paper proves the Neumann case for Euclidean balls in dimensions three and higher, extending the authors' earlier planar…

    solved

    1 attempt

  • Let M(n) be the supremum of ∑_a ∈ A 1/(n-a) over pairwise coprime A ⊂ [1,n). Erdos asked whether M(n) ≤ ∑_p<n 1/p + O(1) uniformly. The average order is settled: ∑_n ≤ N M(n) = e^-γ N loglog N + O(N).

    partial

    1 attempt

  • The Chen-Lawrencenko Conjectures on Cyclic ColorationsBeifang Chen, Serge Lawrencenko, 1999

    A cyclic coloration of a triangulation of a closed 2-manifold gives the faces around every vertex distinct colors. Chen and Lawrencenko made two conjectures about the cyclic chromatic number of minimal triangulations in 1999. Their second…

    disproved

    1 attempt

  • Sixteen previously unknown exact values, plus three that confirm the sibling theorem entries' predictions computationally, across five ordered-pattern families (P^alt, S^sc, C^mon, M^nest, K) under dihedral and reflective group actions -…

    solved

    1 attempt · a verdict recorded from elsewhere

  • Is the O'Shea-Zames-Falb multiplier test necessary for robust stability of Lur'e systems with slope-restricted nonlinearities, as conjectured by Carrasco? No: there is a stable Lur'e interconnection, certified by a full-block multiplier,…

    disproved

    1 attempt

  • Erdős Problem #119Paul Erdős, 1957

    For unit-modulus complex numbers z_i, let p_n(z)=∏_i≤ n(z-z_i) and M_n=max_|z|=1|p_n(z)|. Erdős's prize question: is there c>0 with ∑_k≤ n M_k > n^1+c?

    solved

    1 attempt · a verdict recorded from elsewhere

  • Casalaina-Martin and Zhjeqi proved that the first Chern class of every torsion-free coherent quotient of a tensor power of the logarithmic cotangent sheaf is pseudo-effective, noting in Remark 4.5 that torsion-freeness was imposed only for…

    solved

    1 attempt

  • Erdős Problem #26Paul Erdős, Gérald Tenenbaum, 1995

    Let A⊂N be infinite. Must there exist some k≥ 1 such that almost all integers have a divisor of the form a+k for some a∈ A? The question as posed follows negatively from Davenport–Erdős (1951). The AI result settles Tenenbaum's harder…

    variant

    1 attempt · a verdict recorded from elsewhere

  • Pach conjectured that n Jordan arcs, pairwise crossing exactly once with no triple points, have O(n) tangent pairs. The best known bound stood at O(n^7/4); the paper improves it to O(n^3/2) (and O(n^5/3) in the at-most-one-crossing…

    partial

    1 attempt

  • Strong Graph Reconstruction ConjectureAndrew Bowler, Paul Brown, Trevor Fenner, 2010

    For a graph G, its vertex deck is the multiset of graphs obtained by deleting one vertex. Bowler, Brown, and Fenner (BBF) proposed 2⌊(n−1)/3⌋ as the maximum possible overlap between the decks of two nonisomorphic n-vertex graphs, for all…

    disproved

    1 attempt

  • Completeness of Fixed-Order Atom-Centered DescriptorsSergey N. Pozdnyakov, Michael J. Willatt, Albert P. Bartók, Christoph Ortner, Gábor Csányi, Michele Ceriotti, 2020

    Pozdnyakov, Willatt, Bartók, Ortner, Csányi and Ceriotti showed in 2020 that the 2-, 3- and 4-point correlations of an atomic neighbour density are incomplete: noncongruent environments can share them exactly. Every degeneracy found since…

    disproved

    1 attempt

  • Albertson–Berman Induced Forest ConjectureMichael O. Albertson, David M. Berman, 1979

    Albertson and Berman conjectured that for every simple planar graph G on n vertices, the largest vertex set inducing a forest has size at least n/2. The standing lower bound since the same year has been Borodin's 2n/5, from his acyclic…

    disproved

    1 attempt · a verdict recorded from elsewhere

  • The Largest Sum-Free Subset of the Lattice CubeHarout Aydinian, Peter Cameron; Problem 6 in Ben Green's list of 100 open problems

    How dense can a sum-free subset of the lattice cube 1,…,n^d be? Aydinian and Cameron asked for the limiting density, which is also Problem 6 in Ben Green's list of 100 open problems. The natural conjecture is that the optimum is a slice x…

    solved

    1 attempt

  • Does the block 11 occur infinitely often in the base-2 expansion of the Erdős-Borwein constant E = ∑_n ≥ 1 1/2^n - 1? Posed by Crandall in 2012.

    solved

    1 attempt

  • Uniform Witnesses for Uniform Set Systems: the k=3 QuestionTing-Wei Chao, Zixuan Xu, Dmitrii Zakharov (in the paper's first version), 2026

    In the Frankl-Pach-Erdős circle of VC-dimension problems, the first arXiv version of the paper posed the k=3 case of a witness construction question. ChatGPT 5.4 Pro answered it; the published construction generalizes the model's response,…

    solved

    1 attempt

  • The Matrix Spencer Conjecture for Finite GroupsNikhil Bansal, Haotian Jiang, Raghu Meka, 2022

    The group version of the Matrix Spencer conjecture holds: for every finite group G there are signs ε ∈ ± 1^G with |∑_g ∈ G ε_g ρ(g)| ≤ C√|G|, where ρ is the left regular representation and C is universal.

    solved

    1 attempt

  • Finite-Copy Distillability of NPT States in the DiVincenzo FamilyDavid P. DiVincenzo, Peter W. Shor, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal, 2000

    Whether negative-partial-transpose states undistillable from one copy become distillable from finitely many copies is a basic open problem in entanglement theory. In the canonical two-parameter DiVincenzo family used as its…

    partial

    1 attempt