Related papers: Overpartitions Identities Involving Gaps and Weigh…
The Rogers-Ramanujan-Gordon identities generalize the classical partition identities discovered independently by L. J. Rogers and S. Ramanujan. In 2021, Afsharijoo provided a commutative algebra proof of the Rogers-Ramanujan-Gordon…
We prove two partition identities which are dual to the Rogers-Ramanujan identities. These identities are inspired by (and proved using) a correspondence between three kinds of objects: a new type of partitions (neighborly partitions),…
We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of…
The Rogers-Ramanujan identities and various analogous identities (Gordon, Andrews-Bressoud, Capparelli, etc.) form a family of very deep identities concerned with integer partitions. These identities (written in generating function form)…
The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…
The Rogers-Ramanujan identities are investigated using the Cauchy identity for Schur functions.
We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…
Refinements of the classical Rogers-Ramanujan identities are given in which some parts are weighted. Combinatorial interpretations refining MacMahon's results are corollaries.
Ramanujan listed several q-series identities in his lost notebook. The most well known q-series identities are the Rogers-Ramanujan type identities which are first discovered by Rogers and then rediscovered by Ramanujan. In this paper, we…
In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.
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 a previous paper, the author gave a combinatorial proof and refinement of Siladi\'c's theorem, a Rogers-Ramanujan type partition identity arising from the study of Lie algebras. Here we use the basic idea of the method of weighted words…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
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…
We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.
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…
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,…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…
In 2015 Choi, Kim, and Lovejoy studied a weighted partition function, $A_1(m)$, which counted subpartitions with a structure related to the Rogers--Ramanujan identities. They conjectured the existence of an infinite class of congruences for…