Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Does the finite signed basic adjoint relation determine the invariant signed measure uniquely, and how far beyond the Harrison-Reiman class can uniqueness extend?
Monteiro and Svaiter gave a second-order method for smooth monotone variational inequalities converging at O(T^-1.5), later improved to O(T^-1.75) for the convex-concave minimax subset. Whether the conjectured complexity for general…
Boots and Royle, and independently Cao and Vince, conjectured that the join of an edge with a path on n-2 vertices is the unique planar graph of maximum adjacency spectral radius for every n ≥ 9. Tait and Tobin proved it for sufficiently…
Curto et al. (Advances in Applied Mathematics, 2024) conjectured that every stable fixed point of a threshold-linear network is minimal. Disproved: an explicit competitive 3-neuron TLN has a stable fixed point whose support strictly…
Kollár and Kovács asked whether the first cohomology of the structure sheaf of the fibers must be constant for a flat projective morphism to a smooth curve whose fibers are Cohen-Macaulay and reduced and whose generic fiber is smooth. It…
A Cayley graph is minimal when no proper subset of its connection set generates the group. Babai asked whether minimal Cayley graphs have bounded chromatic number. Resolved negatively: finite minimal Cayley graphs exist with arbitrarily…
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…
Nesterov's accelerated gradient method (1983) is a cornerstone of optimization, yet whether its iterates themselves converge to a minimizer, rather than just the function values, stayed open for over forty years. Jang and Ryu resolve it in…
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 total Chern class of Sym^d(C^n) as a torus representation is a symmetric polynomial whose coefficients were conjectured positive, with a binomial log-concavity refinement. Both are established.
For every connected graph, is the variance of its positive adjacency eigenvalues at most its order divided by its average distance? Exact dumbbell-graph certificates refute the bound under both conventions for average distance.
For S(x) = #(a,b) : a + b ≤ x, σ(a) + σ(b) = σ(a+b), is S(x) ~ cx? The preprint claims S(x) grows faster than x (log x)^R for every fixed R, ruling out the linear asymptotic.
For a differential poset P, must the weighted 2-multichain series M_P,2(q) be a rational multiple of F_P(q)^2, the square of its rank generating series?
What is the shortest curve guaranteed to reach the boundary of the golden gnomon - the isosceles triangle with equal sides 1 and apex angle 108^∘ - from an unknown starting position and heading? The optimum is a symmetric seven-piece path…
For every zonotope Z ⊂ R^d and vectors v_1,…,v_n ∈ Z, there are signs with ∑_i x_i v_i ∈ C√d Z for a universal constant C. This resolves a 2002 conjecture on vector balancing in zonotopes.
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…
Is the density of Chernoff's distribution - the law of argmax_t W(t) - t^2 for two-sided Brownian motion W - strongly log-concave, as conjectured by Balabdaoui and Wellner in 2014?
Is the maximum size of a set A⊆ 1,…,N such that ab+1 is never squarefree (for all a,b∈ A) achieved by taking those n≡ 7pmod25? Resolved for all sufficiently large N: any near-maximal A is contained in n≡ 7pmod25 or n≡ 18pmod25, leaving…
At the critical inverse temperature β=1 in the Sherrington-Kirkpatrick spin glass model, Talagrand conjectured that the expected squared overlap of two independent Gibbs replicas has an exact N^-2/3 scaling: there exists a constant a>0…
Frankl, Peng, Rodl and Talbot asked in 2007 whether the set of Turan densities of families of r-graphs contains intervals. It does: for every r ≥ 3 the set contains non-degenerate intervals, including one of the form [1-δ_r, 1].