← All papers
First page of New lower bounds for even and odd values of the partition function

New lower bounds for even and odd values of the partition function

Liuquan Wang

math.NT Nov 7, 2026 · v2 math.CO
The paper's lower bounds for the parity counts of the partition function were formally verified in Lean by AxiomProver; the files are in a public repository.
Let $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ denote the numbers of integers $0\leq n\leq X$ for which the ordinary partition function $p(n)$ is odd and even, respectively. The Parkin–Shanks conjecture predicts that $N_{\mathrm{odd}}(X)$ and $N_{\mathrm{even}}(X)$ are both asymptotic to $X/2$. Bellaïche and Nicolas proved that $N_{\mathrm{even}}(X)\gg \sqrt{X} \log \log X$, while Zheng, building on work of Ono and Swaminathan, recently proved that $N_{\mathrm{odd}}(X)\gg \sqrt{X}$. We improve both bounds simultaneously by proving $\min\{N_{\mathrm{odd}}(X), N_{\mathrm{even}}(X)\}\gg X^{3/4}/(\log X \log \log X)$. These results have been verified formally in Lean by AxiomProver.

The Parkin–Shanks conjecture predicts that p(n) is odd and even each with density 1/2. Previously known lower bounds were N_even(X) >> sqrt(X) log log X and N_odd(X) >> sqrt(X).

The proof uses Faber polynomials of the series M(q) = sum p(n) q^{24n-1} and a mod-2 symmetry B(d,s) ≡ B(s,d) of their coefficients. Combining this with the theta-like series C(q)^a for powers of two a yields parity congruences for sums of partition values indexed by pairs of primes in residue classes mod 24. The results were then formally verified in Lean by AxiomProver.

The paper proves min{N_odd(X), N_even(X)} >> X^{3/4}/(log X log log X), improving both previous bounds simultaneously. The Lean formalization is available at github.com/mathlqwang/Partition-Parity-Lean.