Combinatorics, Modular Forms, and Discrete Geometry

Tuesday, November 11, 2014 - 11:00am - 11:25am
Keller 3-180
Peter Paule (Johannes Kepler Universität Linz)
In a joint project with George Andrews, aspects of
MacMahon's partition analysis have led us to consider
broken partition diamonds, an infinite family of
combinatorial objects whose generating functions give
rise to a variety of number theoretic congruences.
Recently, in the context of modular forms, Silviu
Radu has set up an algorithmic machinery to prove such
congruences automatically. The talk reports on
recent developments, some being joint work with Radu,
which are related to discrete geometry and computer
MSC Code: