Related papers: The Method of Combinatorial Telescoping
We give new proofs of the twelve Rogers-Ramanujan-type identities due to Rogers and Slater that are traditionally associated with the moduli 7, 14 and 28.
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Several new $q$-supercongruences are obtained using transformation formulas for basic hypergeometric series, together with various techniques such as suitably combining terms, and creative microscoping, a method recently developed by the…
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…
We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next,…
In this paper we will prove a series of $q$-identities suggested by the realisation of certain conformal field theories by so-called `coupled free fermions'. We will consider $q$-series arising from coupled free fermions constructed by the…
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…
We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
In 1981, Adriano Garsia and Steve Milne found the first bijective proof of the celebrated Rogers-Ramanujan identities. To achieve this feat, they invented a versatile tool that they called the Involution Principle. In this note we revisit…
In this article, a short combinatorial proof of the Capelli's identity is given. It also leads to an easy proof of the Capelli--Cauchy--Binet identity, a more general form of Capelli's identity. With the technique introduced, the Turnbull's…
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…
In the present paper, we establish a general transformation for $q$-series which contains L. Wang et al's transformation involved in Nahm series. As direct applications, some concrete new transformation formulas for the ${}_{r+1}\phi_r$…
This paper is a continuation of our papers \cite{EK1, EK2}. In \cite{EK2} we showed that for the root system $A_{n-1}$ one can obtain Macdonald's polynomials as weighted traces of intertwining operators between certain finite-dimensional…
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…