The partition function modulo 4
Number Theory
2022-12-15 v1 Combinatorics
Abstract
It is widely believed that the parity of the partition function 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 we construct a weight 2 meromorphic modular form that is congruent modulo 4 to a certain twisted generating function for the numbers . 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 {\it generalized twisted Borcherds products} developed by Bruinier and the author.
Cite
@article{arxiv.2212.06935,
title = {The partition function modulo 4},
author = {Ken Ono},
journal= {arXiv preprint arXiv:2212.06935},
year = {2022}
}
Comments
Intended for the ICCGNFRT-22 conference proceedings