Congruences satisfied by eta-quotients

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.Fil: Ryan, Nathan C.. Bucknell University.; Estados UnidosFil: Scherr, Zachary. Susquehanna University Mathematical Sciences; Estados UnidosFil: Sirolli, Nicolás Martín. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; ArgentinaFil: Treneer, Stephanie. Western Washington University.; Estados Unido