Congruences like Atkin's for the partition function
Scott Ahlgren, Patrick B. Allen, Shiang Tang

TL;DR
This paper proves the existence of infinitely many partition function congruences similar to Atkin's for all primes and for a large proportion of primes, using modular Galois representations.
Contribution
It establishes the infinite occurrence of Atkin-like congruences for all primes and most primes in the second family, advancing understanding of partition congruences.
Findings
Infinitely many Atkin-like congruences exist for every prime .
For at least 17/24 of primes , infinitely many congruences are found in the second family.
Uses modular Galois representations to prove these results.
Abstract
Let be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form where and are prime and ; these lie in two natural families distinguished by the square class of . In recent decades much work has been done to understand congruences of the form . It is now known that there are many such congruences when , that such congruences are scarce (if they exist at all) when , and that for such congruences exist only when . For congruences like Atkin's (when ), more examples have been found for but little else seems to be known. Here we use the theory of modular Galois representations to prove that for every prime , there are infinitely many…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Algebraic Geometry and Number Theory
