Selected publications.

Nov 2026

Quantum unique ergodicity and the critical crossover for 1-d Gaussian band matrices

Nov 2026

Log-Concavity in Narayana Transforms and Stack-Sorting Fibers

Oct 2026

An Asymptotic Jensen–Pólya Criterion for GRH

The generalized Riemann hypothesis for Dedekind zeta-functions, including the original Riemann Hypothesis, is equivalent to a condition on certain polynomials: every nonzero Jensen polynomial must have only real roots that are negative or zero. Axiom Math has proved that, for every number field, the proportion of negative real roots in this family tends to 100% as the degree grows, with a quantitative bound on the possible exceptions. In other words, we have established an asymptotic form of the classical Jensen–Pólya criterion for GRH. The generalized Riemann hypothesis remains open. These results were autoformalized in Lean with AxiomProver.
Oct 2026

The Unbalanced Group Theorem

Axiom Math mathematicians have developed an alternative proof of a key theorem in the classification of finite simple groups, the basic building blocks of finite groups. The Unbalanced Group Theorem shows how a subgroup's internal structure can determine which family the whole simple group belongs to. While formalizing a published proof, Axiom Math engineers discovered counterexamples to an assertion used in its argument. Other proofs remain valid, and the classification is unaffected. Drawing on Ronald Solomon’s work from 1976, the paper develops a different argument that carefully tracks how simple pieces of subgroups relate to one another. The resulting proof of the simple-group version of the theorem was formalized in Lean with AxiomProver.
Oct 2026

Explicit Positive Lower Density for the Collatz Conjecture

Axiom Math’s Kenny Lau has sharpened a recent theorem on the Collatz conjecture, one of mathematics’ most notorious open problems. Pick a positive integer. If it is even, halve it. If it is odd, triple it and add 1. Repeat. Will you always reach 1? The rules fit on a napkin, but proving that every starting value reaches 1 is another matter! Lech Mazur proved that a positive proportion of starting values reach 1 quickly. Kenny’s paper improves the quantitative bounds, giving an explicit lower bound for that proportion and an explicit threshold beyond which it applies. The guaranteed fraction is tiny, but it does not shrink as the range of starting values grows. 2610.00249v1 Asked to formalize and improve Mazur’s work, AxiomProver autonomously developed the refinement and formalized the main result in Lean. 2610.00249v1
Oct 2026

Ternary Polynomial Relations and Periods of Cusp Forms

Axiom Math mathematicians have proved a conjecture of Bachmann and van Ittersum about polynomials in three variables satisfying two special algebraic rules involving symmetry and rearrangement of variables. The conjecture predicted that every such polynomial must be built from simpler polynomials involving only two variables at a time. This work proves the conjecture and goes further, completely classifying all solutions through modular forms, highly symmetric functions central to number theory. The result reveals a surprising connection between elementary-looking polynomial equations and deep mathematical structures. Developed through weeks of human–AI collaboration, the main theorems and essential argument were formally verified in Lean with AxiomProver.
Oct 2026

A Quasi-Riemann Hypothesis for Dedekind Zeta Functions

Axiom Math mathematicians have proved a quasi-Riemann hypothesis for every Dedekind zeta function. The Riemann hypothesis is one of the deepest open problems in mathematics. It predicts that the zeros of the Riemann zeta function all line up perfectly, which would mean the prime numbers are spread out as evenly as possible. Mathematicians conjecture the same thing for Dedekind zeta functions, one for every number field, extending the classical case to a vast universe of number systems. The full conjecture remains out of reach, but a “quasi” version keeps the zeros out of a band of width 1/32 along the edge. Building on recent work on Artin’s famous Primitive Root Conjecture, the team proved this for every number field at once, and AxiomProver formalized and verified the proof in Lean. The result went to work immediately. The very next day, Fields medalist Manjul Bhargava used it to show that every whole number other than −1 and the perfect squares is a primitive root, meaning its powers cycle through every nonzero remainder, for a positive proportion of primes, a major step toward Artin’s conjecture.
Oct 2026

Local Factors in the BSD Conjecture: A Unified Statistical View

Axiom Math staff and collaborators David Angdinata and Sameera Vemulapalli have established a unified statistical framework for Tamagawa numbers, important local factors in the Birch–Swinnerton-Dyer conjecture. Using a multivariable Euler product derived from Tate’s algorithm, the team proves new limiting distributions, exact covariance formulas, and moment and tail bounds for Tamagawa products of elliptic curves. Among the results, approximately 50.5% of elliptic curves have trivial Tamagawa product, 42.2% have exactly one prime contributing a nontrivial local factor, and 6.8% have exactly two. The paper also establishes negative correlations between distinct prime-adic valuations of Tamagawa products. AxiomProver autoformalized the results in Lean.
Sep 2026

Cutoff for the Adjacent Transposition Shuffle on a Cycle

Axiom Math mathematicians have proved that the adjacent transposition shuffle on a cycle exhibits the cutoff phenomenon. Imagine starting with a sorted deck of $n$ cards. At each step, choose two adjacent cards uniformly at random and swap them. Lacoin proved that this shuffling procedure, called the adjacent transposition shuffle, exhibits the cutoff phenomenon. This means the deck of card stays fairly "unmixed" for a long time before suddenly becoming fairly "mixed" withing a short window of time. The adjacent transposition shuffle on a cycle is a mild variant of this shuffling procedure in which one considers the top and bottom cards of the deck to be adjacent so that they also occasionally swap. Proving cutoff for this variant has resisted efforts until now, mostly because the key ingredients needed for Lacoin's proof break down. AxiomProver formalized and verified this result in Lean, assuming existing literature.
Sep 2026

Rogers–Ramanujan identities from the geometry of $X^a=Y^b$

Axiom Math mathematicians have proved the HJO conjecture, giving a geometric extension of the classical Rogers–Ramanujan and Andrews–Gordon identities for every torus-knot singularity $X^a=Y^b$ with coprime $1<a<b$. The result connects three seemingly different objects: normalized counts of pairs of commuting nilpotent matrices over finite fields satisfying $A^a=B^b$, the HJO q-series, and an explicit infinite product. The team proves a stronger finite identity, identifying the rank N HJO sum with a generating function for balanced cylindric partitions whose entries are bounded by N; taking N to infinity yields the full conjecture. The proof brings together rational shuffle theory, symmetric functions, cylindric partitions, and a common q-difference equation. AxiomProver formalized and verified the finite identity and the HJO conjecture in Lean, conditional on two stated literature inputs.
Sep 2026

On a Conjecture of Browning and Sawin on Random Hypersurfaces with Sign Coefficients

Axiom Math mathematicians have proved the Browning–Sawin conjecture and obtained a quantitative bound. A general homogeneous polynomial over the complex numbers defines a smooth hypersurface, but this genericity says nothing once every coefficient is restricted to a sign ±1, since the sign vectors form a vanishingly small subset of coefficient space. Browning and Sawin conjectured that smoothness nevertheless holds with probability tending to one as the degree grows. The team proved this, showing that a degree d form in n+1 variables with independent uniform coefficients in {−1,1} defines a singular complex hypersurface with probability Oₙ(d^(−1/2)), and that positive-dimensional singular loci occur with exponentially small probability. AxiomProver formalized and verified these results in Lean, assuming existing literature.