Add to ORKGAbstract. In this paper we prove several new parity results for broken k-diamond partitions introduced in 2007 by Andrews and Paule. In the process, we also prove numerous congruence properties for (2k + 1)-core partitions. The proof technique involves a general lemma on congruences which is based on modular forms. 1
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition f...
AbstractWe prove two conjectures of Andrews and Paule [G.E. Andrews, P. Paule, MacMahon’s partition ...
We introduce a crank-like statistic for a different class of partitions. In [4], Andrews and Paule i...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
AbstractIn 2007, Andrews and Paule introduced the family of functions Δk(n) which enumerate the numb...
Recently, Keith used the theory of modular forms to study 9-regular partitions modulo 2 and 3. He ob...
Recently, Hirschhorn and the first author considered the parity of the function a(n) which counts th...
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive...
$t$-core partitions have played important roles in the theory of partitions and related areas. In t...
In recent years, numerous functions which count the number of parts of various types of partitions h...
We investigate the parity of the coefficients of certain eta-quotients, extensively examining the ca...
In a recent paper, Calkin, Drake, James, Law, Lee, Penniston and Radder use the theory of modular fo...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition f...
AbstractWe prove two conjectures of Andrews and Paule [G.E. Andrews, P. Paule, MacMahon’s partition ...
We introduce a crank-like statistic for a different class of partitions. In [4], Andrews and Paule i...
Let (Formula presented.) denote the number of partitions of (Formula presented.) into parts that are...
AbstractIn 2007, Andrews and Paule introduced the family of functions Δk(n) which enumerate the numb...
Recently, Keith used the theory of modular forms to study 9-regular partitions modulo 2 and 3. He ob...
Recently, Hirschhorn and the first author considered the parity of the function a(n) which counts th...
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive...
$t$-core partitions have played important roles in the theory of partitions and related areas. In t...
In recent years, numerous functions which count the number of parts of various types of partitions h...
We investigate the parity of the coefficients of certain eta-quotients, extensively examining the ca...
In a recent paper, Calkin, Drake, James, Law, Lee, Penniston and Radder use the theory of modular fo...
The arithmetic properties of the ordinary partition function p(n) have been the topic of intensive s...
In this paper, we define the partition function pedj;kðnÞ; the number of [j, k]-partitions of n into...
Let n be a positive integer. A partition of n is a sequence of non-increasing positive integ...