English

Parity of the partition function in quadratic progressions

Number Theory 2025-10-06 v2 Combinatorics

Abstract

The parity of the partition function p(n)p(n) remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If 1<D23(mod24)1<D\equiv 23\pmod{24} is square-free and only divisible by primes 1,7(mod8)\ell\equiv 1, 7\pmod 8, then both parities occur infinitely often among p(Dm2+124), p\left(\frac{Dm^2+1}{24}\right), with (m,6)=1.(m,6)=1. The argument takes place on the modular curve X0(6)X_0(6) and shows that parity along these thin orbits is \emph{not constant}. The proof connects classical identities for the partition generating function, through the method of (twisted) Borcherds products, to the arithmetic geometry of {\it ordinary} CM fibers on the Deligne-Rapoport model of X0(6)X_0(6) in characteristic 2. This result is a special case of a general theorem for the coefficients of suitable vector-valued weight 1/2 harmonic Maass forms that satisfy a "Heegner packet'' condition.

Keywords

Cite

@article{arxiv.2509.09553,
  title  = {Parity of the partition function in quadratic progressions},
  author = {Ken Ono},
  journal= {arXiv preprint arXiv:2509.09553},
  year   = {2025}
}

Comments

Minor edits: typos corrected + clarification that reduction at 2 throughout this paper means reduction mod mathfrak{p} dividing 2

R2 v1 2026-07-01T05:32:14.045Z