Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For a perfect field k and a representation-infinite finite-dimensional k-algebra A, the Auslander–Reiten quiver of A has infinitely many connected components. This establishes a conjecture of Auslander, Reiten and Smalø, for…
Mihail and Vazirani conjectured that the graph of every 0/1-polytope has edge expansion at least one. Disproved by a family of 0/1-polytopes whose edge expansion decreases exponentially in the dimension.
Friedland and coauthors proposed a quantum analogue of the p-Wasserstein distance and conjectured that, though only a semidistance in general, it is a true distance for a particular quantum cost matrix and for cost matrices near it. The…
Sabok asked whether the compact convex set S'(X) attached to a separable metric space of diameter at most one is always a simplex, and whether S'(U_1) is the Poulsen simplex. Both answers are negative, with obstructions already visible for…
Wu and Santhanam asked whether one can determine, from an increasing i.i.d. sample of binary random matrices, whether the unknown mean matrix is diagonalizable, while making only finitely many errors almost surely. Answered affirmatively…
For the switch-walk-switch lamplighter walk on Z_2 wr T_d, prove the sharp asymptotic p_2n(e,e) = ρ_d^2n exp[-(π^2 (log(d-1))^2 + o(1)) n/log^2 n] with ρ_d = frac2√d-1d.
For a continuous bounded-variation path with signature g, logarithmic signature l and increment v, the modified Lyons–Sidorova conjecture predicts the structure of g when R(l)=∞. The paper proves it: g=1 when v=0, and otherwise a prefix α…
Kusner conjectured in 1983 that the maximum number of points in R^n that are pairwise at ℓ_p-distance one is exactly n+1 for every 2 < p < ∞, as in the Euclidean case. False: an explicit configuration of n+2 equilateral points exists for…
Conjectured upper bound on how many pairs among n points in the plane can be exactly one unit apart.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
A paper torus is an embedded polyhedral torus isometric to a flat torus. Schwartz proves no paper torus with 7 vertices exists and constructs one with 8, settling the minimum-vertex question in the flat-torus embedding tradition of…
Kac's walk on the rotation group, introduced by Hastings in 1970, is a central high-dimensional Markov chain in statistical physics and computational science. The paper proves it mixes in n^2 log n steps, the conjectured optimal rate,…
Given a binary matrix M, decide whether its columns can be permuted so that every row contains at most two blocks of 1s and, if it contains two blocks, they are separated by at most one 0. The claimed theorem proves that this (2,1)-Gapped…
Zhi-Wei Sun conjectured a closed evaluation of a truncated Legendre-symbol determinant. For every prime p ≡ 3 pmod 4 it equals ⌊ (p-2)/3 ⌋^2 x, proved by reducing to inverse data for Chapman's full Legendre-symbol matrix and evaluating…
For an irreducible crystallographic root system of rank r with Coxeter number h, the paper proves that Au's normalized Witten zeta function has a simple pole at 2/h and evaluates its residue in closed form in terms of the Cartan…
If a chromatic symmetric function is Schur positive, must every finite-variable specialization X_G(x_1, …, x_k) have a saturated Newton polytope? A 12-vertex bipartite graph realizes weights (6,6,0) and (8,2,2) but omits their midpoint…
For n ≥ 4, the natural scalar Poisson-summation certificates cannot prove the Regev-Stephens-Davidowitz Gaussian mass conjecture: any such certificate saturates, so the whole approach is blocked.
For P_n(z) = ∑_k=0^n ε_k z^k with independent uniform signs, does the number R_n of roots in |z| ≤ 1 satisfy R_n/(n/2) → 1 almost surely? The manuscript proves the strong law with R_n = n/2 + O_ω(n^149/150).
Chromatic quasisymmetric functions of natural unit interval graphs were conjectured to have log-concave coefficients in the elementary basis. A connected 13-vertex example refutes it: for the Hessenberg function…
For deterministically minimizing a convex 1-Lipschitz function on the d-dimensional ball using only exact function values, the query complexity sat between Ω(d) and O(d^2 log^2 d) since 1996. The paper proves a near-quadratic lower bound…