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
Two degree inequalities for circle-valued Sobolev maps have constants that degenerate as p → 1^+ or δ → 0^+. Brezis posed the problem of sharpening them; both are now sharpened, by the same power trick with elementary estimates.
For every n≥2 the paper exhibits an n-dimensional K-polystable toric Q-Fano variety whose alpha invariant is exactly 2/2n+1, answering a question of Liu and Zhuang on whether a K-semistable example exists with alpha invariant between 1/n+1…
For A ⊂ F_p of density 1/2, call A almost affine invariant under φ(x) = ax+b if |A triangle φ(A)| = o(p). Problem 90 asks for the threshold K below which A can be almost affine invariant simultaneously under all such φ with |a|, |b| ≤ K…
Nazarov conjectured that for s ∈ (1, 3/2) the quadratic form of the spectral fractional Dirichlet Laplacian strictly increases under u ↦ |u| when u changes sign. Proved and substantially generalized, with the same conclusion for the…
Banach asked in 1932 whether a real Banach space X whose ndimensional subspaces, for some fixed 1 < n < dim X, are all isometric must be a Hilbert space. Gromov proved the conjecture for even n, and subsequent work settled several…
Online Shadow Tomography with log m dependence, while retaining poly(log(d)/ε) dependence. Also, matching the best classical bounds for Adaptive Data Analysis
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…
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
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…
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…
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?
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).
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.
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…
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…
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…
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?
Pełczyński's duality between strictly singular and strictly cosingular operators fails without weak compactness. Beanland asked, in work with Androulakis and later on MathOverflow, for the separable-range case: the paper answers it…
Among d+1 equiprobable equal-energy signals in Gaussian noise, is the regular simplex optimal for average error probability? Yes. The underlying comparison is that for any m × m correlation matrix R with R - 11^ T/m succeq 0 and X ~…
Can the minimum edge-outerplanarity of a finite loopless planar graph, minimized over all planar embeddings, be computed in polynomial time? Asked by Bentz in 2009.