Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
29 problems
Do arbitrarily large 4-chromatic edge-critical graphs exist with minimum degree bounded below by a positive constant times the number of vertices?
Let A ⊂ N be infinite with no distinct a, b, c ∈ A such that a | (b + c) with b, c > a. Can |A ∩ [1, N]|/√N have positive lower limit? Must every such A fall below N^1-c infinitely often?
Borsuk's conjecture asked whether every bounded set in R^n can be partitioned into n+1 subsets of smaller diameter. It is false in dimension 63: there is a set of 321 points in R^63 whose smaller-diameter subsets have at most 5 points, so…
- 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…
For four particles and local dimension D ≥ 4, can a complete edge-coloured, complex-weighted graph have unit perfect-matching amplitude for every monochromatic inherited colouring and zero for every nonmonochromatic one? Ruled out for the…
How large must arithmetic circuits and formulas computing the n × n permanent be? New lower bounds include an arithmetic-formula bound of order n^4/log n, far beyond the quadratic barrier that stood for decades.
How dense can a sphere packing in R^n be as n → ∞? The Kabatiansky-Levenshtein upper bound stood for almost fifty years; the new proof improves the asymptotic upper bound all the way down to the Cohn-Elkies linear-programming threshold.
The Kajitani–Ueno–Miyano conjecture asserts that every finite uniformly dense matroid has a cyclic basis ordering. The conjecture is proved for all matroids of rank three. The new result establishes the previously unresolved divisible…
Huang, Jiang and Oblomkov conjectured that the Eulerian q-series counting commuting pairs of nilpotent matrices with X^a = Y^b equals an explicit theta-and-eta product, making the point count essentially modular. The conjecture is layered…
Ballantine, Beck, Feigon and Maurischat introduced the subsum polynomial sp(λ,x) := ∏_i (1+x^λ_i) attached to an integer partition λ, studied rational functions built by summing reciprocals of these polynomials over natural classes of…
Can a complete edge-coloured, complex-weighted graph realize perfect-matching amplitudes of one on every monochromatic inherited vertex colouring and zero otherwise? Nonexistence is proved in the diagonal family N = D for every even N ≥ 4,…
In the all-heads coin game a player starts with n coins, each showing heads with probability p; each round all remaining coins are flipped, the player must set aside at least one head (losing if none shows), and wins once all coins are set…
What is the maximum size of a binary code of given minimum distance? The linear-programming bounds of McEliece, Rodemich, Rumsey and Welch (1977) resisted improvement for half a century. The new upper bounds are exponentially stronger at…
For an infinite planar set in strong general position, how large can the chromatic and clique numbers of its positive-integer-distance graph be - in particular, can the chromatic number be infinite? Yes: there is such a set, no three…
For the least cutoff c(n) after which every k occurs as the number of homothetic cubes in a decomposition of the unit n-cube, is c(n) ≫ n^n? The Lean proof shows c(n) = o(n^n) along odd dimensions.
Determine the Shannon capacities of odd cycles beyond C_5, or improve the best explicit bounds. Lovasz's theta function settled C_5 in 1979 and every longer odd cycle has stayed open since. The current records, all obtained with model…
In the half-collinear single-minus graviton recursion of Guevara, Lupsasca, Skinner, Strominger and Weil, the multipoint vertex weights depend on global cut tests, which blocks a direct matrix-tree formula outside a restricted decay…
How large can the difference between the largest and second-largest distance multiplicities be among n planar points?
The Riemann hypothesis asserts that every nontrivial zero of the zeta function lies on the critical line. Short of proving it, the standard measure of progress is the proportion of zeros known unconditionally to lie there: Selberg…
The lattice triangle problem asks which rational triangles unfold to Veech surfaces; in the hard obtuse window it is conjectured that none do. Via an arithmetic reformulation of the Mirzakhani-Wright rank obstruction, the paper rules out…