Related papers: A multilateral Bailey Lemma and multiple Andrews--…

We evaluate $q$-Bessel functions at an infinite sequence of points and introduce a generalization of the Ramanujan function and give an extension of the $m$-version of the Rogers-Ramanujan identities. We also prove several generating…

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

In this paper we offer some new identities associated with mock theta functions and establish new Bailey pairs related to indefinite quadratic forms. We believe our proof is instructive use of changing base of Bailey pairs, and offers new…

In this paper, by the method of comparing coefficients and the inverse technique, we establish the corresponding variate forms of two identities of Andrews and Yee for mock theta functions, as well as a few allied but unusual $q$-series…

Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…

I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to…

We establish some new bilateral double-sum Rogers-Ramanujan identities involving parameters. As applications, these identities yield several new multi-sum Rogers-Ramanujan type identities. Our proofs utilize the theory of basic…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and…

Recently, Wang and Ma propose a conjecture associated with the possible generalization of Andrews-Warnaar identities. It is confirmed in this paper. As the applications of this conjecture, we prove that a family of series can be expressed…

Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…

We obtain identities involving symmetric and doubly symmetric polynomials. These identities provide a way of handling expressions appearing in the Atiyah-Bott-Berline-Vergne formula for Grassmannians. As corollaries, we obtain formulas for…

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.

Resorting to the recursions satisfied by the polynomials which converge to the right hand sides of the Rogers-Ramanujan type identities given by Sills and a determinant method presented in a paper by Ismail-Prodinger-Stanton, we obtain many…

In this paper, we first establish two new Bailey pairs via finding two generalizations of Euler's pentagonal number theorem. Next, we specificize the Bailey lemmas with these two Bailey pairs. As applications, we finally establish some…

The G\"ollnitz-Gordon identities were found by G\"ollnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the G\"ollnitz-Gordon identities, called the Andrews-G\"ollnitz-Gordon theorem. In 1980,…

Recently, Andrews and Berkovich introduced a trinomial version of Bailey's lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This largely widens the applicability of the trinomial Bailey lemma…

Inspired by a number of recent papers by Corteel, Dousse, Foda, Uncu and Welsh on cylindric partitions and Rogers-Ramanujan-type identities, we obtain the $\mathrm{A}_2$ (or $\mathrm{A}_2^{(1)}$) analogues of the celebrated Andrews-Gordon…

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…