Related papers: Frobenius's last proof
We give combinatorial proofs for some identities involving binomial sums that have no closed form.
We prove an identity for Hall--Littlewood symmetric functions labelled by the Lie algebra A_2. Through specialization this yields a simple proof of the A_2 Rogers--Ramanujan identities of Andrews, Schilling and the author.
In 1750, Gabriel Cramer famously stated, without proof, his eponymous rule for solving a system of linear equations with as many equations as unknowns. We give a purely combinatorial, and purely self-contained, proof of this old chestnut,…
In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…
Ramanujan's 1920 last letter to Hardy contains seventeen examples of mock theta functions which he organized into three "orders." The most famous of these is the third-order function $f(q)$ which has received the most attention of any…
We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by…
In 1959, N. J. Fine showed that the sum of the multinomial coefficients corresponding to the partitions of a natural number $n$ into $r$ parts is a binomial coefficient: $$ \sum_{\substack{k_1 + k_2 + k_3 + {}\ldots = r \\ k_1 + 2k_2 + 3k_3…
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,…
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…
This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial…
Gustafson and Milne proved an identity on the Schur function indexed by a partition of the form $(\lambda_1-n+k,\lambda_2-n+k,\ldots,\lambda_k-n+k)$. On the other hand, Feh\'{e}r, N\'{e}methi and Rim\'{a}nyi found an identity on the Schur…
We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…
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…
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…
Ramanujan recorded five $q$-series identities at the end of his second notebook and an unified generalization of these identities obtained by Bhoria, Eyyunni and Maji. Recently, Dixit and Patel gave a finite analogue of the identity of…
Bhoria, Eyyunni and Maji recently obtained a four-parameter $q$-series identity which gives as special cases not only all five entries of Ramanujan on pages 354 and 355 of his second notebook but also allows them to obtain an analytical…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
An identity by Ramanujan is expressed using polar coordinates, so that its proof reduces to the verification of an elementary trigonometric identity. This approach produces a few variations on Ramanujan's original identity.
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…