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
For the adjacent-transposition chain on S_n with a regular parameter vector, Fill's spectral gap conjecture (recently resolved) leaves open the characterization of the equality cases. The paper settles them, constructing the additional…
Whether the real Kalton-Peck space Z_2 is isomorphic to its hyperplanes. It is not: no hyperplane of Z_2 is isomorphic to Z_2, proved through a rank parity theorem for symplectic spaces applied to the Kalton-Swanson symplectic structure.
The Howland-Kato conjecture that every nonzero positive commutator i[f(P),g(Q)] must arise from functions in appropriate Kato classes is false: i[arctan(P),arctan(Q)] is nonzero and nonnegative.
A question of Averkov, Hofscheier and Nill on whether the Ehrhart h^*-polynomial of a lattice polytope of large lattice width is real-rooted. Proved in fixed dimension for sufficiently large lattice width, giving strict log-concavity and…
What is the largest A⊆1,…,N such that all subset sums ∑_n∈ S1/n (over S⊆ A) are distinct?
- 1.28249... Lower Bound and Partial Upper Bounds for Cost-Preserving Single-Source Unsplittable Flows
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_max on every…
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
A convex body is in Faber-Krahn position if it minimizes the first Dirichlet eigenvalue within its volume-preserving linear orbit. The paper proves this position is unique up to orthogonal transformations, answering a question of…
Is the depth of the mod-p cohomology ring of every finite group realized as the dimension of one of its associated primes? For G = SmallGroup(128, 859) over overlineF_2 the ring has depth 2 while every associated-prime quotient has…
Does the natural trace estimate hold for kinetic energy spaces in the unrestricted Gaussian velocity model on bounded domains (Question 1.8 of Albritton, Armstrong, Mourrat and Novack)? No: for each 1 ≤ p < 2 there are counterexamples on…
How many pairwise non-overlapping infinite circular cylinders of unit radius can simultaneously touch a unit ball? Kuperberg conjectured in 1990 that the maximum is six.
If a finite graph has girth at least five, must its minimum dual degree satisfy δ^*(G) ≤ -∂_n(G), where ∂_n(G) is the smallest eigenvalue of its distance matrix? The Hoffman-Singleton graph violates it: dual degree 7 against eigenvalue…
Zhu, Gyori, He, Lv, Salia and Xiao conjectured the maximum number of copies of a fixed cycle in an n-vertex graph of bounded circumference, attained by the join of a clique with an independent set. For every fixed s ≥ 3 and L ≥ 2s+2 and…
Erdős and Graham asked whether binomnk with 1 ≤ k ≤ n/2 must always have a divisor ≤ n that is close to n, meaning bigger than a fixed constant times n. Settled in both directions: true when k is large enough as a function of n, but false…
Every finite connected simple graph G satisfies α(G)≥ r(G)+ln(ρ(G)), where α(G) is the independence number, r(G) is the radius, and ρ(G) is the minimum number of pairwise vertex-disjoint paths whose vertices cover V(G).
Monical, Tokcan and Yong conjectured that Schubitopes, the generalized permutahedra arising as Newton polytopes of Schubert polynomials and of Demazure characters of GL_n, are Ehrhart positive. Disproved by an explicit Schubitope whose…
Among all nonconstant monic polynomials f whose roots lie in [-1, 1], determine inf_f |x ∈ R : |f(x)| < 1|.
For a bipartite graph without isolated vertices and with a unique minimum dominating set, does the proposed function m(n, γ) bound the number of edges whenever γ ≥ 2 and n ≥ 3γ? A 13-vertex bipartite graph with 22 edges exceeds the…
Assuming the Unique Games Conjecture, it is NP-hard to approximate MAX-3-CUT better than the Frieze-Jerrum semidefinite program does, and similarly for Quantum MAX-CUT: the sharpness question in the Khot-Kindler-Mossel-O'Donnell line,…
Let A(n) be the least positive integer not dividing binom2nn. Erdos asked for the behaviour of A(n) for reasonable n. Under an explicit dyadic-regularity formalization of reasonable, the distribution is determined on dyadic intervals…