Related papers: Experimenting with the Garsia-Milne Involution Pri…

A series of formula is presented that are all inspired by the Ramanujan Notebooks [6]. One of them appears in the notebooks II about Zeta(3). That formula inspired others that appeared in 1998, 2006 and 2009 on the author's website and…

We give simple elementary proofs of Bressoud's and Schur's polynomial versions of the Rogers-Ramanujan identities

An element of the algebra $M_n(\mathbb{F})$ of $n \times n$ matrices over a field $\mathbb{F}$ is called an involution if its square equals the identity matrix. Gustafson, Halmos, and Radjavi proved that any product of involutions in…

In 2018, Stanton proved two types of generalisations of the celebrated Andrews--Gordon and Bressoud identities (in their $q$-series version): one with a similar shape to the original identities, and one involving binomial coefficients. In…

We derive two general transformations for certain basic hypergeometric series from the recurrence formulae for the partial numerators and denominators of two $q$-continued fractions previously investigated by the authors. By then…

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…

Using new $q$-functions recently introduced by Hatayama et al. and by (two of) the authors, we obtain an A_2 version of the classical Bailey lemma. We apply our result, which is distinct from the A_2 Bailey lemma of Milne and Lilly, to…

Inference of evolutionary trees and rates from biological sequences is commonly performed using continuous-time Markov models of character change. The Markov process evolves along an unknown tree while observations arise only from the tips…

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…

In 1987 Jonathan and Peter Borwein, inspired by the works of Ramanujan, derived many efficient algorithms for computing $\pi$. We will see that by using only a formula of Gauss's and elementary algebra we are able to prove the correctness…

We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can…

Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is…

We present what we call a "motivated proof" of the G\"{o}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…

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…

Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

In a recent paper, Griffin, Ono and Warnaar present a framework for Rogers-Ramanujan type identities using Hall-Littlewood polynomials to arrive at expressions of the form \[\sum_{\lambda : \lambda_1 \leq m}…

Via the contour integral method, we establish a reduction formula from a double series to a single series with parameters, which not only implies Uncu and Zudilin's two results and Cao and Wang's two results, but also is related to…

The Alder-Andrews Theorem, a partition inequality generalizing Euler's partition identity, the first Rogers-Ramanujan identity, and a theorem of Schur to $d$-distinct partitions of $n$, was proved successively by Andrews in 1971, Yee in…

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…