Related papers: Combinatorial approach to Andrews-Gordon and Bress…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
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…
This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…
Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which also leads to a double-sum extension of the $q$-Chu-Vandermonde formula.
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…
In this paper, by the technique of inverse relations and comparing coefficients, we establish some generalized forms of Andrews' q-series identity and two new Bailey pairs and q-identities closely related to Andrews-Warnaar's sum identity…
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…
The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to…
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition…
The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key…
This paper is a continuation of earlier work of Arslan \cite{Ars}, who introduced the Mahonian number of type $B$ by using a new statistic on the hyperoctahedral group $B_{n}$, in response to questions he suggested in his paper entitled…
We provide a general and unified combinatorial framework for a number of colored partition identities, which include the five, recently proved analytically by B. Berndt, that correspond to the exceptional modular equations of prime degree…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…
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,…
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…
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…