Congruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors

From MaRDI portal
Publication:5402467




Abstract: In his 1984 AMS Memoir, George Andrews defined the family of k--colored generalized Frobenius partition functions. These are denoted by cphik(n) where kgeq1 is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all ngeq0, cphi2(5n+3)equiv0pmod5. Soon after, many authors proved congruence properties for various k--colored generalized Frobenius partition functions, typically with a small number of colors. Work on Ramanujan--like congruence properties satisfied by the functions cphik(n) continues, with recent works completed by Baruah and Sarmah as well as the author. Unfortunately, in all cases, the authors restrict their attention to small values of k. This is often due to the difficulty in finding a "nice" representation of the generating function for cphik(n) for large k. Because of this, no Ramanujan--like congruences are known where k is large. In this note, we rectify this situation by proving several infinite families of congruences for cphik(n) where k is allowed to grow arbitrarily large. The proof is truly elementary, relying on a generating function representation which appears in Andrews' Memoir but has gone relatively unnoticed.




Cited in
(22)






This page was built for publication: Congruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402467)