相关论文: The $A_2$ Rogers-Ramanujan identities revisited
We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…
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…
By using the Kang-Kashiwara-Misra-Miwa-Nakashima-Nakayashiki crystal base character formula for the basic $A_2^{(1)}$-module, and the principally specialized Weyl-Kac character formula, we obtain a Rogers-Ramanujan type combinatorial…
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.
What follows is a lightly edited version of the author's unpublished master's essay, submitted in partial fulfillment of the requirements of the degree of Master of Arts at the Pennsylvania State University, dated June 1994, written under…
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_\omega(n)$ and $p_\nu(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an…
In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…
A generalized Bailey pair, which contains several special cases considered by Bailey (\emph{Proc. London Math. Soc. (2)}, 50 (1949), 421--435), is derived and used to find a number of new Rogers-Ramanujan type identities. Consideration of…
We give simple elementary proofs of Bressoud's and Schur's polynomial versions of the Rogers-Ramanujan identities
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…
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…
In a handwritten manuscript published with his lost notebook, Ramanujan stated without proofs forty identities for the Rogers-Ramanujan functions. We observe that the functions that appear in Ramanujan's identities can be obtained from a…
We prove a q-series identity that generalises Macdonald's A_{2n}^{(2)} eta-function identity and the Rogers-Ramanujan identities. We conjecture our result to generalise even further to also include the Andrews-Gordon identities.
An identity by Ramanujan is expressed using polar coordinates, so that its proof reduces to the verification of an elementary trigonometric identity. This approach produces a few variations on Ramanujan's original identity.
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 provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon's combinatorial generalization of the Rogers-Ramanujan…
Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan…
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections.
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…