Congruences for combinatorial functions

Speaker: Dr. Robert Osburn (UCD)

Time: 4:00PM
Date: Wed 31st October 2007

Location: Mathematical Sciences Seminar Room

We discuss an effective algorithm due to Eichhorn and Ono which allows one to prove congruences for certain combinatorial functions by checking only a finite number of values.

(This talk is part of the K-Theory, Quadratic Forms and Number Theory series.)