Related papers: Goellnitz-Gordon partitions with weights and parit…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

Let $ped(n)$ denote the number of partitions of $n$ wherein even parts are distinct (and odd parts are unrestricted). We show infinite families of congruences for $ped(n)$ modulo $8$. We also examine the behavior of $ped_{-2}(n)$ modulo $8$…

We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…

For the past several years, numerous authors have studied POD and PED partitions from a variety of perspectives. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…

The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

By employing the classical tools from the theory of $q$-series and theta functions, new fascinating identities on different continued fractions can be achieved. In this article, we use the product expansion of Jacobi's theta function to…

We improve S.-C. Chen's result on the parity of Schur's partition function. Let $A(n)$ be the number of Schur's partitions of $n$, i.e., the number of partitions of $n$ into distinct parts congruent to $1, 2 \mod{3}$. S.-C. Chen…

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…

Recently, Ballantine and Welch considered various generalizations and refinements of POD and PED partitions. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be…

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 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…