Related papers: Bressoud Style Identities for Regular Partitions a…

We present what we call a "motivated proof" of the Andrews-Bressoud partition identities for even moduli. A "motivated proof" of the Rogers-Ramanujan identities was given by G. E. Andrews and R. J. Baxter, and this proof was generalized to…

In this paper, we combined two types of partitions and introduced 2-colored Rogers-Ramanujan partitions. By finding some functional equations and using a constructive method, some identities have been found. Some Overpartition identities…

We give simple elementary proofs of Bressoud's and Schur's polynomial versions of the Rogers-Ramanujan identities

In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned…

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

We derive by analytic means a number of bilateral identities of the Rogers--Ramanujan type. Our results include bilateral extensions of the Rogers--Ramanujan and the G\"ollnitz-Gordon identities, and of related identities by Ramanujan,…

We give a commutative algebra viewpoint on Andrews recursive formula for the partitions appearing in "Gordon's identities", which are a generalization of Rogers-Ramanujan identities. Using this approach and differential ideals we conjecture…

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…

In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the…

We find involutions for three Rogers-Ramanujan-Gordon type identities obtained by Andrews on the generating functions for partitions with part difference and parity restrictions.

We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…

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…

We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered…

Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is…

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey…

In the first three papers, we conducted a series of discussions on the statistics of strict partitions and Rogers-Ramanujan partitions, specifically the sequences of odd length (denoted as $\mathrm{sol}$) and its extensions. We established…

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

We provide a refinement of MacMahon's partition identity on sequence-avoiding partitions, and use it to produce another mod 6 partition identity. In addition, we show that our technique also extends to cover Andrews's generalization of…

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…