Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Shokurov's global index conjecture, in the setting of foliations. Proved for foliations in dimension at most three, which also answers a question of Liu, Meng and Xie in dimension three.
The classical Abbott-Hanson recurrence gives S(k+2) ≥ 9S(k)+4 for Schur numbers, and had stood as the basis for the best asymptotic lower bounds. Shifted S-templates, a more flexible form of Rowley's template construction, yield S(k+2) ≥…
Let A(x) count n ≤ x such that every prime p | n has a divisor d > 1 of n with d ≡ 1 pmod p. Erdos asked whether A(x)/x = exp(-(c+o(1))√log xloglog x). It does, with c = 1/(2√log 2).
The Hessian conjecture HC_n asks whether every polynomial f with det Hess(f) ∈ C^× has a polynomial gradient inverse. It is known for n ≤ 3, false for n ≥ 5, and open exactly in dimension four, where it implies the plane Jacobian…
Regts and Sevenster conjectured that a complex-valued graph parameter f with f(∅)=1 has exponentially bounded edge-connection rank precisely when it is a mixed partition function. The paper proves it, with the numbers of even and odd…
For a finite-dimensional algebra A, finite global dimension forces HH_n(A) = 0 for all large n. Han conjectured the converse: eventual vanishing of Hochschild homology should detect homological smoothness. Disproved by an explicit…
Erdős, Herzog and Piranian (1958) asked whether the regular n-gon maximizes the product of pairwise distances among n points of fixed diameter. After the recent discovery that it does not for even n, this paper proves the first exponential…
Does the Dinitz-Garg-Goemans cost-preserving unsplittable-flow rounding conjecture survive on acyclic planar instances with only four terminals? An explicit instance answers no: every cost-nonincreasing unsplittable routing has upper…
For A=0,1,2^d, write f(d) for the fewest proper sub-boxes covering every point exactly twice. Leader, Miličević and Tan asked whether f(d)≥ 2^d for all d, as Question 4.1 of the PatternBoost paper. The paper gives new bounds on f(d).
Let D_q(n) be the largest possible least degree of a polynomial omitted by a non-covering family of n distinct-modulus congruence classes in F_q[x]. What is its asymptotic size? The answer is D_q(n) = n/q-1 + O_q(1).
What is the best deterministic polynomial-time approximation ratio for the permanent of a Hermitian positive semidefinite matrix? Resolved up to lower-order terms in the exponent: an explicit concave maximisation widehat P(A) satisfies…
For a forbidden configuration F, the Anstee-Sali conjecture predicts that forb(m, F) is Theta(m^(X(F)-1)), where X(F) comes from an explicit product construction. Disproved: the 4-uniform family on six vertices formed by a two-vertex core…
Does the Hodge bundle Ω_g over the moduli stack of genus g ≥ 2 curves contain any nontrivial sub-bundles? Posed by Dawei Chen around 2015; the answer is no.
Does a general pencil of plane cubics over C have exactly 12 common flex lines? Ciliberto, Miranda and Roé asked this in Remark 5.3 of their paper; the answer is yes.
Amdeberhan, Shareshian and Stanley showed a function from the theory of partition Eisenstein series counts alternating permutations with a given record partition, and asked whether a similar theory exists for record compositions,…
If origin-symmetric convex bodies K, L ⊂ R^n satisfy vol_m(K ∩ E) ≤ vol_m(L ∩ E) for every m-dimensional subspace E with 1 < m < n, does vol_n(K) ≤ vol_n(L) follow? Answered affirmatively for subspace dimensions m = 2 and m = 3.
Let S(x) count ordered pairs (a,b) with a+b ≤ x and σ(a)+σ(b) = σ(a+b). Erdos asked whether S(x) ~ cx. The opposite extreme holds: for every R > 0, S(x)/(x(log x)^R) → ∞, so the count beats every fixed logarithmic scale.
For the released four-terminal planar acyclic single-source unsplittable-flow gadget, require one unsplittable routing to be no more expensive than a prescribed fractional routing under each of m strictly positive full-demand…
Determine the leading asymptotic of the largest eigenvalue of the N-Majorana quartic SYK Hamiltonian as N → ∞. The preprint proves λ_1/√N → 4∫_0^∞ g_0(t)^4 dt ≈ 0.32504 almost surely, via the limiting free energy at every fixed positive…
Is it true that for every ε,η>0 there exists a k such that the density of n for which P(n(n+1)…(n+k))>n^1-ε is at least 1-η, where P(m) is the greatest prime divisor of m? A short argument via the Matomäki-Radziwiłł theorem establishes the…