Related papers: The Method of Combinatorial Telescoping
We derive a combinatorial identity which is useful in studying the distribution of Fourier coefficients of L-functions by allowing us to pass from knowledge of moments of the coefficients to the distribution of the coefficients.
This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…
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 present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…
This paper presents a symbolic computation method for automatically transforming $q$-hypergeometric identities to $q$-binomial identities. Through this method, many previously proven $q$-binomial identities, including $q$-Saalsch\"utz's…
For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…
We use Zeilberger's algorithm for proving some identities of Ramanujan-type via $_2F_1$ evaluations.
For the Lucas sequence $\{U_{k}(P,Q)\}$ we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrence sequences. With the help of which we find an interpolating…
We derive by analytic means a number of bilateral identities of the Rogers--Ramanujan type. Our results include bilateral extensions of the Rogers--Ramanujan and the G\"ollnitz-Gordon identities, and of related identities by Ramanujan,…
Using a simple classical method we derive bilateral series identities from terminating ones. In particular, we show how to deduce Ramanujan's 1-psi-1 summation from the q-Pfaff-Saalschuetz summation. Further, we apply the same method to our…
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…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…
Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…
In his lost notebook, Ramanujan listed 5 identities related to the false theta function $$f(q)=\sum_{n=0}^\infty (-1)^nq^{n(n+1)/2}.$$ A new combinatorial interpretation and proof of one of these identities is given. The methods of the…
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 prove four new Rogers-Ramanujan-type identities for double series. They follow from the classical Rogers-Ramanujan identities using the constant term method and properties of Rogers-Szeg\H{o} polynomials.
The Bailey lemma is a famous tool to prove Rogers-Ramanujan type identities. We use shifted versions of the Bailey lemma to derive $m$-versions of multisum Rogers-Ramanujan type identities. We also apply this method to the Well-Poised…
The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…