Related papers: Finite Rogers--Ramanujan type identities

In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…

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.

We generalize the "motivated proof" of the Rogers-Ramanujan identities given by Andrews and Baxter to provide an analogous "motivated proof" of Gordon's generalization of the Rogers-Ramanujan identities. Our main purpose is to provide…

We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…

A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…

We give an easy approach to L. Slater's Bailey pairs A(1)-A(8) with the help of q-Lucas polynomials.

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

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 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 extend partition-theoretic work of Andrews, Bressoud, and Burge to overpartitions, defining the notions of successive ranks, generalized Durfee squares, and generalized lattice paths, and then relating these to overpartitions defined by…

This is a tutorial for using two new MAPLE packages, thetaids and ramarobinsids. The thetaids package is designed for proving generalized eta-product identities using the valence formula for modular functions. We show how this package can…

We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…

The product sides of the Rogers--Ramanujan identities and alike often appear to be "transparently modular" (functions). The old work by Rogers (1894) and recent work by Rosengren make use (somewhat implicitly) of this fact for proving the…

We state and prove a number of unilateral and bilateral $q$-series identities and explore some of their consequences. Those include certain generalizations of the $q$-binomial sum which also generalize the $q$-Airy function introduced by…

In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…

We prove a family of partition identities involving integer partitions in three colors. The conditions imposed on the types of partitions appearing in these identities involve constraints that arise in the Rogers-Ramanujan and…

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…

By studying non-commutative series in an infinite alphabet we introduce shift-plethystic trees and a class of integer compositions as new combinatorial models for the Rogers-Ramanujan identities. We prove that the language associated to…

George Andrews [\emph{Bull. Amer. Math. Soc.}, 2007, 561--573] introduced the idea of a \emph{signed partiton} of an integer; similar to an ordinary integer partitions, but where some of the parts could be negative. Further, Andrews…

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…