Related papers: Partition theorems and the Chinese remainder theor…

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…

A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the…

Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly $j$ different multiples of $r$, for a…

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…

For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset…

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…

In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and…

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…