Occasion: Combinatory Analysis 2018 (in honor of George Andrews' 80th birthday)
Place: Penn State University
AbstractThe Gauss congruences are a natural generalization of the more familiar Fermat and Euler congruences. Interesting families of combinatorial and number theoretic sequences are known to satisfy these congruences. Though a general classification remains wide open, Minton characterized constant recursive sequences satisfying Gauss congruences. We consider the natural extension of this question to Laurent coefficients of multivariate rational functions. This talk is based on joint work with Frits Beukers and Marc Houben.
|2018gausscongruences-andrews.pdf||720.46 KB||Slides (PDF, 60 pages)||155|