ProbXiv
Explorersign in

problems

Leaderboard716 problems
501–520 of 716 problems
  • How few vertices can a triangulation of RP^5 have? The paper presents a 6-dimensional centrally symmetric simplicial polytope whose antipodal boundary quotient gives a 24-vertex triangulation, far below previous constructions in the…

    partial

    1 attempt

  • If A generates a bounded C_0-semigroup on a Hilbert space and has dense range, does A^-1 also generate a bounded C_0-semigroup? Posed by deLaubenfels in 1988. Answered negatively: Lorist, Meyries and Veraar construct a bounded operator…

    disproved

    1 attempt

  • Erdős Problem #856Paul Erdős, 1970

    Let k≥ 3 and f_k(N) be the maximum of ∑_n∈ A1/n over all A⊆1,…,N containing no k subsets with the same pairwise least common multiple. Estimate f_k(N). The claimed answer: f_k(N)=(log N)^γ_k+o(1), where γ_k is a weighted generalization of…

    candidate

    1 attempt

  • The Order of Long Rainbow Arithmetic ProgressionsVeselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic, 2003

    Let T_k be the least t such that every equinumerous t-coloring of [tn] contains a rainbow k-term arithmetic progression. Jungic, Licht, Mahdian, Nesetril and Radoicic conjectured T_k = Θ(k^2); Conlon, Fox and Sudakov proved T_k = O(k^2 log…

    disproved

    1 attempt

  • The Integer Domination Root ConjectureS. Akbari, S. Alikhani, M. R. Oboudi, Y.-H. Peng, 2010

    Akbari, Alikhani, Oboudi and Peng conjectured in 2010 that 0 and -2 are the only integer roots of the domination polynomial D(G, x), proven for trees and unicyclic graphs and verified exhaustively for small orders. The paper gives a…

    disproved

    1 attempt

  • Seymour conjectured that every oriented graph has a vertex x with |N^++(x)| ≥ |N^+(x)|. It holds for oriented graphs of minimum out-degree exactly 7, the first improvement to the out-degree threshold since Kaneko and Locke settled degree 6…

    partial

    1 attempt

  • Online Shadow Tomography with log m dependence, while retaining poly(log(d)/ε) dependence. Also, matching the best classical bounds for Adaptive Data Analysis

    solved

    1 attempt

  • Crouzeix's ConjectureMichel Crouzeix, 2004

    Crouzeix conjectured in 2004 that for every square complex matrix A and every polynomial p, lVert p(A)rVert ≤ 2 max_z ∈ W(A) |p(z)|, where W(A) is the numerical range of A - that is, the numerical range is a 2-spectral set. Crouzeix proved…

    solved

    1 attempt · a verdict recorded from elsewhere

  • Erdős Problem #863Paul Erdős, 1992

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

    solved

    1 attempt · a verdict recorded from elsewhere

  • The Minimal Distance ProblemCohen, Pohoata, Zakharov

    How well separated can a family of point-line pairs in the unit square be? For every ε > 0 there are arbitrarily large families (x_1,ℓ_1),…,(x_n,ℓ_n) in [0,1]^2 with x_i ∈ ℓ_i and dist(x_i,ℓ_j) ≥ n^-2/3-ε for all i ≠ j. Combined with…

    solved

    1 attempt

  • The interchange graph G(R,S) has the (0,1)-matrices with row sums R and column sums S as vertices, adjacent when they differ by a single 2× 2 interchange. Brualdi asked whether G(R,S) is always Hamiltonian. It satisfies more: it is…

    solved

    1 attempt

  • For the Fubini numbers a(n), is a(n) = ∑_k=0^2^n-1-1 A284005(k) for every n > 0, as conjectured on the OEIS in 2018?

    solved

    1 attempt

  • Every minimally generically globally rigid graph in R^d containing a subgraph isomorphic to K_d+2 is itself isomorphic to K_d+2, confirming Conjecture 6.3 of Garamvölgyi, Jackson and Jordán (2025).

    solved

    1 attempt

  • Written on the Wall II, Conjecture 284Written on the Wall II (automated conjecturing)

    WOW-284 asserts that the minimum dual degree of every connected graph of order at least three and girth at least five is at most the negative of its least distance eigenvalue. The paper refutes it with exact counterexamples of orders 38,…

    disproved

    1 attempt

  • For a semistable one-parameter family of complex projective varieties with smooth nearby fiber X_t and monodromy T, is the map H^1(X, Z) → H^1(X_t, Z)^T surjective? True in degree one, although the integral statement fails in higher degree.

    solved

    1 attempt · a verdict recorded from elsewhere

  • Every natural number is a finite sum of distinct unit fractions whose denominators are semiprimes. This is the ω = 2 integer case of a problem of Erdos and Graham, left as a conjecture by Butler, Erdos and Graham, who proved the ω = 3…

    solved

    1 attempt

  • Sharp Bounds on the Ground State Energy of the SYK ModelFeng, Tian and Wei; predicted by Garcia-Garcia, Jia and Verbaarschot, 2019

    For the Sachdev-Ye-Kitaev Hamiltonian on n Majorana modes with k-body interactions, the paper proves E|H|_op = (1-o(1))√2n/k for super-constant k ≤ o(√n), confirming predictions of Garcia-Garcia, Jia and Verbaarschot and answering a…

    solved

    1 attempt

  • Wellman and Pettie noted that the true leading constant for large-order Davenport-Schinzel sequences was known only to lie in an interval. The paper improves the Roselle-Stanton lower bound to match the pigeonhole upper bound in the…

    solved

    1 attempt

  • Do the one-species current marginals of type-D ASEP have the predicted Tracy-Widom long-time asymptotics despite the model's two-species interactions?

    solved

    1 attempt

  • The Odd Area Conjecture for Unit Disksconjectured in the discrete geometry literature

    For a family F of an odd number n of unit disks in the plane, let OA(F) be the area covered by an odd number of disks. It was conjectured that OA(F) ≥ π, the area of a single disk. False: configurations exist with smaller odd area.

    disproved

    1 attempt · a verdict recorded from elsewhere