We study partitions of n into parts that occur at most thrice, with weights whose definition is motivated by an identity of Jacobi. A combinatorial bijection between odd and even partitions of maximum weight is extended to a bijection of ``potholes'' (partitions supplied with extra structure) which is used to show that, when n is not triangular, the numbers of odd and even partitions of any weight are equal. The situation for triangular numbers is also analyzed, and this provides a new proof of Jacobi's identity. Finally, the numbers of potholes are related to a Jacobi theta function, and several other combinatorial connexions are noted
AbstractFori=1, 2, 3, 4, letQi(n) denote the number of partitions of n into distinct parts ≢ (mod4)....
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's Lost Notebook, th...
We study partitions of n into parts that occur at most thrice, with weights whose definition is m...
AbstractAn alternate form of the Jacobi identity is equivalent to the assertion that the number of p...
AbstractA Combinatorial lemma due to Zolnowsky is applied to partition theory in a new way. Several ...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In a recent note, Santos proved that the number of partitions of n using only odd parts equals the n...
AbstractThe theorem “ the number of partitions of a positive integer n into distinct odd parts equal...
The theorem `` the number of partitions of a positive integer n into distinct odd parts equals the n...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
We prove two identities related to overpartition pairs. One of them gives a generalization of an ide...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
AbstractWe prove two identities related to overpartition pairs. One of them gives a generalization o...
AbstractFori=1, 2, 3, 4, letQi(n) denote the number of partitions of n into distinct parts ≢ (mod4)....
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's Lost Notebook, th...
We study partitions of n into parts that occur at most thrice, with weights whose definition is m...
AbstractAn alternate form of the Jacobi identity is equivalent to the assertion that the number of p...
AbstractA Combinatorial lemma due to Zolnowsky is applied to partition theory in a new way. Several ...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In recent years, numerous functions which count the number of parts of various types of partitions h...
In a recent note, Santos proved that the number of partitions of n using only odd parts equals the n...
AbstractThe theorem “ the number of partitions of a positive integer n into distinct odd parts equal...
The theorem `` the number of partitions of a positive integer n into distinct odd parts equals the n...
In this work, we consider the function ped(n), the number of partitions of an integer n wherein the ...
We prove two identities related to overpartition pairs. One of them gives a generalization of an ide...
Let $R_2(n)$ denote the number of partitions of $n$ into parts that are odd or congruent to $\pm 2 \...
AbstractWe prove two identities related to overpartition pairs. One of them gives a generalization o...
AbstractFori=1, 2, 3, 4, letQi(n) denote the number of partitions of n into distinct parts ≢ (mod4)....
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's Lost Notebook, th...