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

The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper…

In this paper, we explore the role that Liu's transformation formula can play in discovering Rogers-Ramanujan type identities. Specifically, we combine Liu's transformation formula with other $q$-series summations to derive a series of…

The celebrated Mason's conjecture states that the sequence of independent set numbers of any matroid is log-concave, and even ultra log-concave. The strong form of Mason's conjecture was independently solved by Anari, Liu, Oveis Gharan and…

In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…

The theory of Bailey's transform provides a systematic method for deriving $q$-identities, the key factor of which is the Bailey pair. The concept of Bailey pair was first extended to bilateral version by Paule. In this paper, following…

Bertoin and Le Gall (2003) introduced a certain probability measure valued Markov process that describes the evolution of a population, such that a sample from this population would exhibit a genealogy given by the so-called…

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.

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,…

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…

In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…

We present proofs of two new families of sum-product identities arising from the cylindric partitions paradigm. Most of the presented expressions, the related sum-product identities, and the ingredients for the proofs were first conjectured…

The asymptotic probability theory of conjugacy classes of the finite general linear and unitary groups leads to a probability measure on the set of all partitions of natural numbers. A simple method of understanding these measures in terms…

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.

When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing method can be extended, and taught to a computer, and can prove…

We use an integral method to establish a number of Rogers-Ramanujan type identities involving double and triple sums. The key step for proving such identities is to find some infinite products whose integrals over suitable contours are…

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…

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…

We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…

We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…