Related papers: Parity Considerations in Rogers-Ramanujan-Gordon T…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
Very recently, Thejitha, Sellers, and Fathima defined the function $a_{r,s}(n)$, which enumerates the number of multicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors,…
In 2017, Keith presented a comprehensive survey on integer partitions into parts that are simultaneously regular, distinct, and/or flat. Recently, the authors initiated a study of partitions into parts that are simultaneously regular and…
A multiparameter generalization of the Bailey pair is defined in such a way as to include as special cases all Bailey pairs considered by W. N. Bailey in his paper, "Identities of the Rogers-Ramanujan type," [Proc. London Math. Soc. (2), 50…
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that…
We present proofs of two new families of sum-product identities arising from the cylindric partitions paradigm. Most of the presented expressions, the related sum-product identities, and the ingredients for the proofs were first conjectured…
Andrews and the third author recently studied congruences for certain restricted two-color partitions. They made two conjectures for Ramanujan-type congruences and a vanishing identity for the limiting sequence. In this paper, we settle…
We present what we call a "motivated proof" of the Bressoud-G\"ollnitz-Gordon partition identities. Similar "motivated proofs" have been given by Andrews and Baxter for the Rogers-Ramanujan identities and by Lepowsky and Zhu for Gordon's…
We generalize the theory of linked partition ideals due to Andrews using finite automata in formal language theory and apply it to prove three Rogers--Ramanujan type identities of modulo 14 that were posed by Nandi through vertex operator…
We derive two general transformations for certain basic hypergeometric series from the recurrence formulae for the partial numerators and denominators of two $q$-continued fractions previously investigated by the authors. By then…
For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving…
We give manifestly positive Andrews-Gordon type series for the level 3 standard modules of the affine Lie algebra of type $A^{(1)}_2$. We also give corresponding bipartition identities, which have representation theoretic interpretations…
It is known that $q$-orthogonal polynomials play an important role in the field of $q$-series and special functions. During studying Dyson's "favorite" identity of Rogers--Ramanujan type, Andrews pointed out that the classical orthogonal…
We refine and generalise a Rogers-Ramanujan type partition identity arising from crystal base theory. Our proof uses the variant of the method of weighted words recently introduced by the first author.
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…
A proof of the first Rogers-Ramanujan identity is given using admissible neighborly partitions. This completes a program initiated by Mohsen and Mourtada. The admissible neighborly partitions involve an unusual mod 3 condition on the parts.
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…