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
The paper nearly settles the tradeoff between the size of a set system over [n] and its number of full chains, an extremal question raised by Johnson, Leader and Russell as a counterpart to Sperner-type results, and linked by recent work…
Near-optimal density thresholds forcing a measurable set in R^d to contain all sufficiently large similar copies of every n-point configuration, answering a question from the Euclidean density theorem literature up to logarithmic factors.
The Courtade-Kumar conjecture (2014) posits that dictatorship functions maximize mutual information between a Boolean function's output and a noisy input. The paper resolves an open question posed by Courtade and Kumar themselves - a sharp…
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?
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.…
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…
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…
Regev and Stephens-Davidowitz conjectured that Z^n maximizes the Gaussian mass Θ_L(t) = ∑_x ∈ L e^-t|x|^2 over stable lattices for every t > 0. The sharp inequality holds for every integral unimodular lattice of rank n ≤ 32, with equality…
We prove a Nakai-Moishezon-type criterion for complex Hessian-type equations on projective manifolds whose associated degree-n polynomials are strongly strictly right-Noetherian. For strictly right-Noetherian polynomials of arbitrary…
Bajpai, Dona and Nitsche left three degree-six symplectic hypergeometric monodromy groups unclassified as arithmetic or thin. Two of the three, C-47 and C-55, are arithmetic.
Let x_n = tan(∑_k=1^n arctan k). Amdeberhan, Medina and Moll conjectured that x_n ∉ Z for every n ≥ 5. Any integer value x_n = m must satisfy |m| ≥ e^(1/2+o(1)) n log n, which forces #1 ≤ n ≤ N : x_n ∈ Z = O(log N). The conjecture…