The method of constant terms and k-colored generalized Frobenius partitions

Abstract

In his 1984 AMS memoir, Andrews introduced the family of k-colored generalized Frobenius partition functions. For any positive integer k, let cϕk(n) denote the number of k-colored generalized Frobenius partitions of n. Among many other things, Andrews proved that for any n≥0, cϕ2(5n+3)≡0(mod5). Since then, many scholars subsequently considered congruence properties of various k-colored generalized Frobenius partition functions, typically with a small number of colors.In 2019, Chan, Wang and Yang systematically studied arithmetic properties of CΦk(q) with 2≤k≤17 by employing the theory of modular forms, where CΦk(q) denotes the generating function of cϕk(n). We notice that many coefficients in the expressions of CΦk(q) are not integers. In this paper, we first observe that CΦk(q) is related to the constant term of a family of bivariable functions, then establish a general symmetric and recurrence relation on the coefficients of these bivariable functions. Based on this relation, we next derive many bivariable identities. By extracting and computing the constant terms of these bivariable identities, we establish the expressions of CΦk(q) with integral coefficients. As an immediate consequence, we prove some infinite families of congruences satisfied by cϕk(n), where k is allowed to grow arbitrary large.