The partition function modulo 4
Abstract
It is widely believed that the parity of the partition function p(n) is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free integer 1<D 2324, we construct a weight 2 meromorphic modular form that is congruent modulo 4 to a certain twisted generating function for the numbers p(Dm2+124) 4. We prove the existence of infinitely many linear dependence congruences modulo 4 among suitable sets of holomorphic normalizations of these series. These results rely on the theory of class numbers and Hilbert class polynomials, and generalized twisted Borcherds products developed by Bruinier and the author.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.