Using the ``Freshman's dream to prove combinatorial congruences
From MaRDI portal
Publication:4575401
Abstract: In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences, namely those (like the Catalan and Motzkin sequences) that are expressible in terms of constant terms of powers of Laurent polynomials. We first give a leisurely exposition of their elementary but brilliant approach, and then extend it in two directions. The Laurent polynomials may be of several variables, and instead of single sums we have multiple sums. In fact we even combine these two generalizations! We conclude with some super-challenges. In this version we report that Roberto Tauraso pointed out that all our conjectured super-congruences, at the end of our article are already known, except one, for which he supplied a beautiful proof that can be found here: arXiv:1606.05543.
Recommendations
- Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
- Two triple binomial sum supercongruences
- Dwork's congruences for the constant terms of powers of a Laurent polynomial
- On some new congruences for binomial coefficients
- An invitation to formal power series
Cites work
- Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
- Catalan Numbers
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- On two conjectural supercongruences of Apagodu and Zeilberger
- The On-Line Encyclopedia of Integer Sequences
- Two triple binomial sum supercongruences
Cited in
(15)- Constant term evaluation and two kinds of congruence
- On some congruences involving trinomial coefficients
- On binomial coefficients modulo squares of primes
- On the Atkin and Swinnerton-Dyer type congruences for some truncated hypergeometric \(_1F_0\) series
- Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
- Elementary proof of congruences involving sum of binomial coefficients
- Proof of a conjecture of Adamchuk
- A \(q\)-analogue of Apagodu-Zeilberger congruence
- Congruence properties for the trinomial coefficients
- On a supercongruence conjecture of Z.-W. Sun
- Congruences on sums of \(q\)-binomial coefficients
- Supercongruences involving Lucas sequences
- Further generalizations of four supercongruences of Rodriguez-Villegas
- Two triple binomial sum supercongruences
- Congruences on sums of super Catalan numbers
This page was built for publication: Using the ``Freshman's dream to prove combinatorial congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575401)
