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.

---

中文翻译：

---

eta商满足的同余

摘要：已知分区函数的值以及更一般的许多模块化形式的傅立叶系数都满足一定的等价性。Ahlgren和Ono给出的分配函数结果和Treneer给出的更一般的傅立叶系数结果表明，存在无限多个同余族。在本文中，我们提供了一种算法，用于为η商计算此类同余的显式实例。我们通过一些示例来说明我们的方法。

---