分野別セミナー

There are several known algorithms for proving combinatorial summation identities (due to Sister Celine, Gosper, and Wilf-Zeilberger, among others). Recently, there has been work adapting these algorithms to prove combinatorial congruences. In this talk, I will describe an algorithm for proving combinatorial congruences by computing expansions in terms of truncated multiple zeta values. I will also explain how to apply motivic Galois theory to these expansions to obtain a Galois theory of congruences.