A few years ago Foda, Quano, Kirillov and Warnaar proposed and proved various finite analogs of the celebrated Andrews-Gordon identities. In this paper we use these polynomial identities along with the combinatorial techniques introduced in our recent paper to derive Garrett, Ismail, Stanton type formulas for two variants of the Andrews-Gordon identities.
The object of this paper is to propose and prove a new generalization of the Andrews-Gordon identities, extending a recent result of Garrett, Ismail and Stanton. We also give a combinatorial discussion of the finite form of their result, which appeared in the work of Andrews, Knopfmacher, and Paule.
We present what we call a "motivated proof" of the Göllnitz-Gordon-Andrews identities. A similar motivated proof of the Rogers-Ramanujan identities was previously given by G. E. Andrews and R. J. Baxter, and was subsequently generalized to Gordon's identities by J. Lepowsky and M. Zhu. We anticipate that the present proof of the Göllnitz-Gordon-Andrews identities will illuminate certain twisted vertex-algebraic constructions.
A multilateral Bailey Lemma is proved, and multiple analogues of the Rogers--Ramanujan identities and Euler's Pentagonal Theorem are constructed as applications. The extreme cases of the Andrews--Gordon identities are also generalized using the multilateral Bailey Lemma where their final form is written in terms of determinants of theta functions.
We construct Andrews-Gordon type evidently positive series as generating functions for the partitions satisfying the difference conditions imposed by Capparelli's identities and Göllnitz-Gordon identities. The construction involves building base partitions, and move parts around subject to certain rules. Some missing cases are also considered, but no new identities are given.
In 1967, Andrews found a combinatorial generalization of the Göllnitz-Gordon theorem, which can be called the Andrews-Göllnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered as the generating function counterpart of the Andrews-Göllnitz-Gordon theorem. Lovejoy gave an overpartition analogue of the Andrews-Göllnitz-Gordon theorem for $i=k$. In this paper, we give an overpartition analogue of this theorem in the general case. By using Bailey's lemma and a change of base formula due to Bressoud, Ismail and Stanton, we obtain an overpar…
In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of occurrences of even numbers or odd numbers in the Rogers-Ramanujan-Gordon type. The Rogers-Ramanujan-Gordon type partition was defined by Gordon in 1961 as a combinatorial generalization of the Rogers-Ramaujan identities with odd moduli. In 1974, Andrews derived an identity which can be considered as the generating function counterpart of the Rogers-Ramanujan-Gord…
We construct Andrews-Gordon type evidently positive series as generating functions of partitions satisfying certain difference conditions in six conjectures by Kanade and Russell. We construct generating functions for missing partition enumerants, naturally without claiming new partition identities. Thus, we obtain $q$-series conjectures as companions to Kanade and Russell's combinatorial conjectures.
We give a proof of a recent combinatorial conjecture due to the first author, which was discovered in the framework of commutative algebra. This result gives rise to new companions to the famous Andrews-Gordon identities. Our tools involve graded quotient rings, Durfee squares and rectangles for integer partitions, and $q$-series identities.
We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.
Using the theory of intertwining operators for vertex operator algebras we show that the graded dimensions of the principal subspaces associated to the standard modules for $\hat{\goth{sl}(2)}$ satisfy certain classical recursion formulas of Rogers and Selberg. These recursions were exploited by Andrews in connection with Gordon's generalization of the Rogers--Ramanujan identities and with Andrews' related identities. The present work generalizes the authors' previous work on intertwining operators and the Rogers--Ramanujan recursion.
In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related generating function if the moduli is three. We provide new companions to Rogers-Ramanujan-Andrews-Gordon identities under this conjecture.
We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified according to their parities or values mod 3 are also considered. Direct combinatorial interpretations of the series are provided.
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 tools the authors employed, we obtain new partition identities by identifying further sets of partitions that can be explicitly put into a one-to-one correspondence by the method described in the 1995 paper. As a further result, although of a different nature, we obtain an analytical identity of Rogers-Ramanujan type, involving generating functions, for a cla…
The Göllnitz-Gordon identities were found by Göllnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the Göllnitz-Gordon identities, called the Andrews-Göllnitz-Gordon theorem. In 1980, Bressoud extended the Andrews-Göllnitz-Gordon theorem to even moduli, called the Bressoud-Göllnitz-Gordon theorem. Furthermore, Bressoud gave the generating functions for the generalizations of the Göllnitz-Gordon identities. In this article, we will give new companions to the generalizations of the Göllnitz-Gordon identities.
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 the odd-moduli case of Gordon's identities by J. Lepowsky and M. Zhu. Recently, a "motivated proof" of the somewhat analogous Göllnitz-Gordon-Andrews identities has been found. In the present work, we introduce "shelves" of formal series incorporating what we call "ghost series," which allow us to pass from one shelf to the next via natural recursions, leadi…
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 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 insight into certain vertex-algebraic structure being developed.
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and refinements of the generalisations of Andrews' theorems to overpartitions. The proof relies on the method of weighted words of Alladi and Gordon and $q$-difference equation techniques introduced recently by the author.
Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in overpartition identities. We extend Sang, Shi, and Yee's work to arbitrary moduli, and also provide a missing case in their identities. We also unify proofs of Rogers-Ramanujan-Gordon identities for overpartitions due to Lovejoy and Chen et.al.; Sang, Shi, and Yee's results; and ours. Although verification type proofs are given for brevity, a construction of se…
In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his work, Andrews noted two congruences modulo $3$ for the number of singular overpartitions prescribed by parameters $k=3$ and $i=1$. It should be noticed that this number equals the number of the Rogers--Ramanujan--Gordon type overpartitions with $k=i=3$ which come from the overpartition analogue of Gordon's Rogers--Ramanujan partition theorem introduced by Che…
We prove certain Nahm-type sum representations for the (odd modulus) Andrews-Gordon identities, the (even modulus) Andrews-Bressoud identities, and Rogers' false theta functions. These identities are motivated on one hand by a recent work of C. Jennings-Shaffer and one of us on double pole series, and, on the other hand, by Córdova, Gaiotto and Shao's work on defect Schur's indices.
In this paper we prove the identity that generalizes the Andrews-Gordon identity. Also we discuss the relation of our formula to the geometry of affine flag varieties and to the geometry of polyhedra.
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 multiplicity conditions on the parts. This leads to many new partition and overpartition identities, and provides a unification of a number of well-known identities of the Rogers-Ramanujan type. Among these are Gordon's generalization of the Rogers-Ramanujan identities, Andrews' generalization of the Göllnitz-Gordon identities, and Lovejoy's ``Gordon's theor…
We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow Kurşungöz's ideas to provide direct combinatorial interpretations of some of our expressions. We use of the trinomial analogue of Bailey's lemma to derive new identities. These identities relate triple sums and products. A couple of new Slater type identities are also noted.
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 a family of partition identities which extend Gordon's identities. This family is indexed by r >=2. We prove the conjecture for r=2 and r=3.
Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and Göllnitz' identities too. In this paper, we present a new variant of this method, which can be used to study more complicated partition identities, and apply it to prove refinements and generalisations of three partition identities. The first one, Siladić's theorem (2002), comes from vertex operator algebras. The second one, a conjectural identity of Primc (1999), comes from crystal base th…
Finding an Andrews--Gordon type generating function identity for a linked partition ideal is difficult in most cases. In this paper, we will handle this problem in the setting of graph theory. With the generating function of directed graphs with an ``empty'' vertex, we then turn our attention to a $q$-difference system. This $q$-difference system eventually yields a factorization problem of a special type of column functional vectors involving $q$-multi-summations. Finally, using a recurrence relation satisfied by certain $q$-multi-summations, we are able to provide non-computer-assisted proof…
Capparelli conjectured two modular identities for partitions whose parts satisfy certain gap conditions, where were motivated by the calculation of characters for the standard modules of certain affine Lie algebras and by vertex operator theory. These identities were subsequently proved and refined by Andrews, who related them to Jacobi theta functions, and also by Alladi-Andrews-Gordon, Capparelli, and Tamba-Xie. In this paper we prove two new companions to Capparelli's identities, where the evaluations are expressed in terms of Jacobi theta functions and false theta functions.
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 certain difference conditions. Bressoud's conjecture specializes to a wide variety of well-known theorems in the theory of partitions. Special cases of his conjecture have been subsequently proved by Bressoud, Andrews, Kim and Yee. Recently, Kim resolved Bressoud's conjecture for the case $j=1$. In this paper, we introduce a new partition function $\bar{B}_j$ whi…
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 identities. Generalizations of each of these theorems are given where a single part is "marked" or weighted. This allows a single part to be replaced by a new larger part, "shifting" a part, and analogous combinatorial results are given in each case. Versions are also given for marking a sum of parts.