2000 character limit reached
Congruences modulo powers of 11 for some eta-quotients
Published 2 Jun 2019 in math.NT | (1906.00428v1)
Abstract: The partition function $ p_{[1c11d]}(n)$ can be defined using the generating function, [\sum_{n=0}{\infty}p_{[1c{11}d]}(n)qn=\prod_{n=1}{\infty}\dfrac{1}{(1-qn)c(1-q{11 n})d}.] In this paper, we prove infinite families of congruences for the partition function $ p_{[1c11d]}(n)$ modulo powers of $11$ for any integers $c$ and $d$, which generalizes Atkin and Gordon's congruences for powers of the partition function. The proofs use an explicit basis for the vector space of modular functions of the congruence subgroup $\Gamma_0(11)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.