Related papers: A partition identity and the universal mock theta …

We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's…

Let $\mathcal O_r(n)$ be the set of $r$-regular partitions of $n$, $\mathcal D_r(n)$ the set of partitions of $n$ with parts repeated at most $r-1$ times, $\mathcal O_{1,r}(n)$ the set of partitions with exactly one part (possibly repeated)…

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

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…

In this paper, we find an identity which connects the overpartition function and the function of Rogers--Ramanujan--Gordon type overpartitions by considering the weights and gaps. This identity can be seen as an analogue of the weighted…

We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…

This work follows the spirit of Andrews' series of papers on Partition Analysis. In $2011$, Savage and Sills found new sum sides for the little G\"ollnitz identities and provided their partition interpretations. It turns out that similar…

We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

We prove several infinite families of $q$-series identities for false theta functions and related series. These identities are motivated by considerations of characters of modules of vertex operator superalgebras and of quantum…

We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…

We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating…

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

We show how certain suitably modified N-modular diagrams of integer partitions provide a nice combinatorial interpretation for the general term of Zeilberger's KOH identity. This identity is the reformulation of O'Hara's famous proof of the…

Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial…

Recently, Pankaj Jyoti Mahanta and Manjil P. Saikika proved some identities relating certain restricted partitions into distinct odd parts with the partition whose odd parts are distinct combinatorially. They asked for the q-series proofs.…

Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…