← All papers
First page of Parity of the partition function in quadratic progressions

Parity of the partition function in quadratic progressions

Ken Ono, Ashvin Swaminathan

math.NT Sep 11, 2025 · v4 math.CO
The paper's algebraic identities and the sqrt(X) lower bound for odd partition numbers were formalized in Lean by AxiomProver, with public GitHub repositories.
The parity of the partition function $p(n)$ is one of the most stubborn problems in number theory. In 2010, the first author conjectured, for square-free $1<D\equiv 23\pmod{24}$, that the values $p\!\left(\frac{Dm^2+1}{24}\right)$, as $m$ ranges over positive integers with $(m,6)=1$, include infinitely many even and infinitely many odd terms. We prove this conjecture. The key new idea is geometric. Logarithmic derivatives of twisted Borcherds products built from Ramanujan's third-order mock theta functions recast the problem in terms of CM points of discriminant $-D$ on $X_0(6)$. The uniqueness of canonical lifts from characteristic $2$ to characteristic zero shows that the CM points supporting the poles remain distinct after reduction modulo $2$. This fact, combined with an Eisenstein series comparison and a Galois representation argument, rules out constant parity and gives infinitely many values of each parity. The method applies to the coefficients of analogous generalized twisted Borcherds products. These results imply that \[\#\{0\leq n\leq X: p(n)\text{ is odd}\}\gg\sqrt X,\] which is now the best known lower bound for odd values of $p(n)$. The algebraic identities at the heart of this paper, as well as the improved lower bound for odd partition numbers, have been formalized in Lean by AxiomProver.

The paper proves Ono's 2010 conjecture: for square-free D ≡ 23 (mod 24), the values p((Dm^2+1)/24) with (m,6)=1 include infinitely many even and infinitely many odd terms. A consequence is an improved lower bound for the number of odd values of the partition function p(n).

Logarithmic derivatives of twisted Borcherds products built from Ramanujan's third-order mock theta function recast the parity question in terms of CM points of discriminant -D on X_0(6). Uniqueness of canonical lifts from characteristic 2 shows that the CM poles stay distinct after reduction mod 2. An Eisenstein series comparison and a Galois representation argument then rule out constant parity. The algebraic identities and the corollary were formalized in Lean by AxiomProver.

The conjecture is proved, and #{n ≤ X : p(n) odd} ≫ √X, now the best known lower bound. The Lean formalizations are available in the AxiomMath/PartitionParity and AxiomMath/PartitionZheng repositories.