In 2021 da Silva, Hirschhorn, and Sellers studied a wide variety of congruences for the $k$-elongated plane partition function $d_k(n)$ by various primes. They also conjectured the existence of an infinite congruence family modulo arbitrarily high powers of 2 for the function $d_7(n)$. We prove that such a congruence family exists -- indeed, for powers of 8. The proof utilizes only classical methods, i.e., integer polynomial manipulations in a single function, in contrast to all other known infinite congruence families for $d_k(n)$ which require more modern methods to prove
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{pa...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In this paper we study restricted partition functions of the form pk(q2m+b), for certain primes q, w...
George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo po...
In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which gener...
AbstractIn 2007, Andrews and Paule introduced the family of functions Δk(n) which enumerate the numb...
In this paper, we establish infinite families of congruences in consecutive arithmetic progressions ...
AbstractIn 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-co...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
AbstractRamanujanʼs famous partition congruences modulo powers of 5, 7, and 11 imply that certain se...
Recently, Lin introduced two new partition functions PD$_t(n)$ and PDO$_t(n)$, which count the total...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{pa...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In this paper we study restricted partition functions of the form pk(q2m+b), for certain primes q, w...
George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo po...
In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which gener...
AbstractIn 2007, Andrews and Paule introduced the family of functions Δk(n) which enumerate the numb...
In this paper, we establish infinite families of congruences in consecutive arithmetic progressions ...
AbstractIn 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-co...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
AbstractAlthough much is known about the partition function, little is known about its parity. For t...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
In 2007, Andrews and Paule introduced a new class of combinatorial objects called broken k-diamond p...
AbstractRamanujanʼs famous partition congruences modulo powers of 5, 7, and 11 imply that certain se...
Recently, Lin introduced two new partition functions PD$_t(n)$ and PDO$_t(n)$, which count the total...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{pa...
In 2010, Andrews, Michael D. Hirschhorn and James A. Sellers considered the function ped(n), the num...
In this paper we study restricted partition functions of the form pk(q2m+b), for certain primes q, w...