Related papers: Copartitions
In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
Partitions associated with mock theta functions have received a great deal of attention in the literature. Recently, Choi and Kim derived several partition identities from the third and sixth order mock theta functions. In addition, three…
Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical…
Recently, Andrews, Dixit and Yee introduced partition functions associated with Ramanujan/Watson third order mock theta functions $\omega(q)$ and $\nu(q)$. In this paper, we find several new exact generating functions for those partition…
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…
We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
In 2015, Bringmann, Lovejoy and Mahlburg considered certain kinds overpartitions, which can been seen as the overpartition analogue of Schur's partition. The motivation of their work is that the difference between the generating function of…
The generating function of partitions with repeated (resp. distinct) parts such that each odd part is less than twice the smallest part is shown to be the third order mock theta function $\omega(q)$ (resp. $\nu(-q)$). Similar results for…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…
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…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
Relations involving the Rogers-Ramanujan continued fractions $R(q),$ $R(q^3 ),$ and $R(q^4)$ are used to find new generating functions and congruences modulo 5 and 25 for 3-core, 4-core, 4-regular, and colored partition functions.
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
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…