# Congruences modulo powers of 11 for some eta-quotients

## TL;DR

This paper establishes infinite families of congruences modulo powers of 11 for a class of partition functions defined via eta-quotients, extending previous results by Atkin and Gordon through modular form techniques.

## Contribution

It generalizes Atkin and Gordon's congruences for partition functions by proving new infinite families of congruences modulo powers of 11 for eta-quotient-based partition functions.

## Key findings

- Proves infinite families of congruences modulo powers of 11.
- Uses an explicit basis for modular functions of (11).
- Extends previous congruence results to broader classes of partition functions.

## Abstract

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\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}.\] In this paper, we prove infinite families of congruences for the partition function $ p_{[1^c11^d]}(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)$.