Congruences for modular forms and generalized Frobenius partitions (Q780442): Difference between revisions

The \(k\)-colored generalized Frobenius partitions were introduced by [\textit{G. E. Andrews}, Generalized Frobenius partitions. Providence, RI: American Mathematical Society (AMS) (1984; Zbl 0544.10010)] as a new family of objects which generalize partitions of an integer. These are enumerated by \(c\phi_k(n)\), where \(k\geq 1\) is the number of colors in question. George E. Andrews [loc. cit.] proved that \(c\phi_2(5n+3) \equiv 0 \pmod 5\). Then many authors proved congruence properties for various \(k\)-colored generalized Frobenius partition functions, typically with a small number of colors. In this paper, the authors prove that there are infinitely many congruences for \(c\phi_k(n)\) modulo \(\ell\), where \(gcd(\ell, 6k) = 1\). Some results on the parity of \(c\phi_k(n)\) are provided in this context.