| The Collatz conjecture |
3n+1 is the only exactly critical map of this form. There are four articles on this problem, and this is the entrance
|
| The Riemann hypothesis |
The explicit formula run both ways — building the staircase of primes from the zeros, and recovering the height of the zeros from the primes. And Λ = 0 exactly, which is to say no slack at all
- How far the published logs alone reach — Λ ≤ 0.19 follows from Polymath15's public logs alone (no novelty). What remains is nine discrepancies in the manuscript
- Sunk eigenvalues of the Weil quadratic form — the Weil form with compactly supported test functions has about e2L − 7/8 eigenvalues sunk almost to zero; their number gets a lower bound that does not assume the Riemann hypothesis. None of it can prove or disprove the hypothesis
|
| The Erdős conjecture on arithmetic progressions |
The record 3.0085385 for k=3 and the record 4.4397535 for k=4 are each a single machine-checked theorem |
| The BSD conjecture |
|Ш| agreeing to thirteen decimal places across ranks 0–7, with the record of turning the verification of curve labels into a mechanism |
| Yang–Mills and the mass gap |
A textbook-scale exposition (Parts 0–11 and appendices, 124 chapters). From reading the problem statement word by word, through the difference between two or three dimensions and four, the lattice, constructive field theory, the view from physics and a dictionary of the two languages, to where things stand and the study on this machine |
| The Hodge conjecture |
On CM abelian varieties the Hodge classes reduce to finite combinatorics. At the smallest place where the exceptional classes leave the Weil classes, the problem comes down to a single Hodge class of codimension 2. Also the threshold t₃ of a model of the secant-sheaf type, and a reproduction of the walls on Fermat varieties. No algebraicity is proved |
| P versus NP |
Where the ladder of negations stops — the price of 1 negation is half the correlation margin, the ceiling n−1/2 is a matter of principle, and the window that cannot be reached has width log log N. No claim is machine-checked. Continued in Formula size as a function on truth tables |
| The Lovász conjecture |
Four exceptions. The search space for a fifth splits three ways by the deficiency def
|
| The Hadwiger–Nelson problem |
f(α), the largest unit-distance graph with independence number at most α: f(3) = 10, and f(4) is 14 or 15 |
| Four points with distinct circumradii |
Seven points in general position always contain four whose four circumradii are pairwise different; six do not. The whole chain is checked in Lean |
| Drawing unsolved problems at random |
A record of the smaller problems — Sierpiński numbers, Riesel numbers, distinct distances, and five small records (#1087, #104, #99, #40, #30) |