Papers
Topics
Authors
Recent
Search
2000 character limit reached

The partition function modulo 4

Published 13 Dec 2022 in math.NT and math.CO | (2212.06935v1)

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\equiv 23\pmod{24},$ we construct a weight 2 meromorphic modular form that is congruent modulo 4 to a certain twisted generating function for the numbers $p\big(\frac{Dm2+1}{24}\big)\pmod 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 {\it generalized twisted Borcherds products} developed by Bruinier and the author.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.