2000 character limit reached
On $\ell-$regular and $2-$color partition triples modulo powers of $3$ (2504.13507v1)
Published 18 Apr 2025 in math.CO and math.NT
Abstract: Let $T_\ell(n)$ denote the number of $\ell-$regular partition triples of $n$ and let $p_{\ell, 3}(n)$ enumerates the number of 2--color partition triples of $n$ where one of the colors appear only in parts that are multiples of $\ell$. In this paper, we prove several infinite families of congruences modulo powers of 3 for $T_\ell(n)$ and $p_{\ell, 3}(n)$, where $\ell \geq 1$ and $\equiv 0\pmod{3k}$, and $\equiv \pm 3k \pmod{3{k+1}}$.