arXiv · 1911.05799
Congruences satisfied by eta-quotients
Abstract
The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general Fourier coefficients state the existence of infinitely many families of congruences. In this article we give an algorithm for computing explicit instances of such congruences for eta-quotients. We illustrate our method with a few examples.
Explore related subjects
Keep this discovery
Nathan C. Ryan, Zachary Scherr, Nicolás Sirolli, Stephanie Treneer. 2019-11-13. Congruences satisfied by eta-quotients. https://doi.org/10.1090/proc%2F15293
Cite the original work for its findings. Save a collection to share your selection of sources.