Congruences modulo powers of 11 for some eta-quotients

The partition function p[1c11d](n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ p_{[1^c11^d]}(n)$$\end{document} can be defined using the generating function, ∑n=0∞p[1c11d](n)qn=∏n=1∞1(1-qn)c(1-q11n)d.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \sum _{n=0}^{\infty }p_{[1^c{11}^d]}(n)q^n=\prod _{n=1}^{\infty }\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}. \end{aligned}$$\end{document}In this paper, we prove infinite families of congruences for the partition function p[1c11d](n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ p_{[1^c11^d]}(n)$$\end{document} 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 Γ0(11)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Gamma _0(11)$$\end{document}.