Institute of Mathematics for Industry


List All(1169) Today and tomorrow's seminars(0)

Proving combinatorial congruences with truncated multiple zeta values

Hold Date 2019-11-25 15:00~2019-11-25 16:00

Place Seminar Room W1-C-615, West Zone 1, Ito campus, Kyushu University

Object person  

Speaker Julian Rosen (University of Maine)

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.