Some congruences for sums of binomial coefficients

Moa Apagodu
Virginia Commonwealth University
Friday, April 12, 2019 - 3:35pm to 4:35pm
Vincent Hall 570

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 and then extend it in two directions. The Laurent polynomials may be of several variables, and instead of single sums we have multiple sums.