Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let D_n be the dihedral group of order 2n and run a continuous-time random walk on it driven by symmetric jump rates whose support generates the group. Call the pair (D_n,p) rate-monotonic if, at every fixed time, the ℓ^p distance between…
A Mathematics Stack Exchange question posted on 3 August 2014 asks when the standard divisibility lower bound for determinants of Latin square matrices is attained. For an n× n Latin square L with entries 1,…,n, let b_n= n^2(n+1)/2, n odd,…
Conjectures 2a and 2b of Kauers and Zeilberger, on the asymptotics of a family of restricted lattice walks. Both are obtained from a local limit theorem for excursions of Markov-modulated random walks in cones.
On page 408 of Calabi's 1958 paper "Construction and Properties of Some 6-Dimensional Almost Complex Manifolds" we find: "...it is still unknown whether the sphere S^6 or any product manifold V^2 × S^4 (V^2 = any closed, orientable…
The big-line-big-clique conjecture of Kára, Pór and Wood asserts that for all k, ℓ there is an n such that every finite point set of at least n points contains ℓ collinear points or k points that pairwise see each other. True for ℓ = 4, k…
Let D⊆ F_2^19 be the fixed 4096-word ambient binary linear code used in Ho’s 19-dimensional improvement of the Cohn–Li kissing construction. Is every subset A⊆ D with minimum Hamming distance at least 5 of size at most 1280? No linearity…
We resolve the long-standing problem of establishing interior C^2 estimates for admissible solutions of the graphical scalar curvature equation in every dimension n≥ 3. More precisely, we prove interior curvature estimates for admissible…
If a,b,c,d∈Oz are omnific integers and ab=cd, then there exist omnific integers e,f,g,h∈Oz such that a=ef, b=gh, c=eg, d=fh. Equivalently, every equality of two products in the omnific integers admits a common four-factor refinement.
Let Mul4: F_2^8 -> F_2^7 output the seven coefficients of the product of two four-term binary polynomials. The manuscript proves that its unrestricted XOR--AND multiplicative complexity is exactly 9. The upper bound is a nine-AND…
For the m-loop quiver, the numerical Donaldson–Thomas invariants DT^(m)_n (Kontsevich–Soibelman/Reineke) satisfy v_p(DT^(m)_n)≥ v_p(n) for every prime p≥5, with exact defects at p=2,3: v_3≥ v_3(n)-[m≡2 (3)] and v_2≥ v_2(n)-[m≡2,3 (4)], and…
Haglund's Conjecture 4 reads: for k≥1, the imaginary part of each non-real zero of Ξ_k(z)+tΦ_k+1(z) decreases monotonically as t goes from 0 to 1, where the Φ_n are the incomplete-gamma summands of Riemann's series for Ξ and Ξ_k=∑_n≤ kΦ_n.…
Write H_1 = liminf_n→∞(p_n+1-p_n). Announced on 1 September 2026: H_1 ≤ 236, building on Stadlmann's 240 of the previous day.
Let S,S' be sets and let r∈ F(S)'∖e, r'∈ F(S')'∖e be relators with ⟨ S | r ⟩ ≅⟨S' | r'⟩. Does this imply that scl_S r=scl_S'r'?
For integers a≥1 and b≥1-a, the series C_a,b=∑_n=1^∞ n!/((a+1)n+b)! is transcendental. Equivalently, the series in Erdős Problem 270 is transcendental whenever f(n)=an+b is a positive integer-valued affine function.
Carathéodory's conjecture, Problem 8.1 of Ghomi's list and traceable to 1922, asks whether every closed convex surface in R^3 has at least two umbilic points. Hamburger settled the real-analytic case in 1940-41 and it stands. The C^∞ case…
Let k be a field of characteristic zero and let S=k[x_1,x_2,x_3,x_4]. We prove Fröberg's predicted Hilbert series for ideals generated by r general forms of equal degree d for every r≥1 in each of the two cases d=5 and d=7. Relative to the…
Every integer-valued strongly b-additive function g with gcd(g(1),…,g(b−1)) = 1 and nonnegative digit mean takes prime values at infinitely many primes, with a Mertens-type formula and normal-order results; the running example resolves the…
Ekhad and Zeilberger's second computational Chomp challenge asks for a Chomp position with three winning opening moves. Answered by exhibiting a bar with three winning opening moves.
The Foregger–Sinkhorn tie-point conjecture, Conjecture 41 in Minc's survey, asserts that if a nearly decomposable doubly stochastic matrix minimizes the permanent on a face and the permanental cofactor at a prescribed zero exceeds its…
Call an integer admissible if it is congruent to a square modulo b−1 (for b = 2 the condition is vacuous). For every base b ≥ 2 there are constants c_b, C_b > 0 such that the following holds: if q is sufficiently large and admissible, then…