English

Congruences for a class of eta-quotients and their applications

Number Theory 2020-11-17 v2

Abstract

The partition function p[1cd](n) p_{[1^c\ell^d]}(n) can be defined using the generating function, n=0p[1cd](n)qn=n=11(1qn)c(1qn)d.\sum_{n=0}^{\infty}p_{[1^c{\ell}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{\ell n})^d}. In \cite{P}, we proved infinite family of congruences for this partition function for =11\ell=11. In this paper, we extend the ideas that we have used in \cite{P} to prove infinite families of congruences for the partition function p[1cd](n)p_{[1^c\ell^d]}(n) modulo powers of \ell for any integers cc and dd, for primes 5175\leq \ell\leq 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()\Gamma_0(\ell). Finally we used these congruences to prove congruences and incongruences of the generalized Frobenius \ell-color partitions, \ell-regular partitions and \ell-core partitions for =5,7,11,13\ell=5,7,11,13 and 1717.

Keywords

Cite

@article{arxiv.2010.01594,
  title  = {Congruences for a class of eta-quotients and their applications},
  author = {Shashika Petta Mestrige},
  journal= {arXiv preprint arXiv:2010.01594},
  year   = {2020}
}