Congruences for a class of eta-quotients and their applications
Abstract
The partition function p[1cd](n) can be defined using the generating function, \[Σn=0∞p[1cd](n)qn=Πn=1∞1(1-qn)c(1-q n)d.\] In P, we proved infinite family of congruences for this partition function for =11. In this paper, we extend the ideas that we have used in P to prove infinite families of congruences for the partition function p[1cd](n) modulo powers of for any integers c and d, for primes 5≤ ≤ 17. This generalizes Atkin, Gordon and Hughes' congruences for powers of the partition function. The proofs use an explicit basis for the vector space of modular functions of the congruence subgroup 0(). Finally we used these congruences to prove congruences and incongruences of the generalized Frobenius -color partitions, -regular partitions and -core partitions for =5,7,11,13 and 17.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.