Restricted Partition

Thursday, November 13, 2014 - 3:30pm - 3:55pm
Felix Breuer (Johannes Kepler Universität Linz)
The restricted partition function p(n,d) which counts the number of partitions of n into parts of size at most d is one of the most classic objects in combinatorics. From the point of view of Ehrhart theory, p(n,d) counts integer points in dilates of a (d-1)-dimensional simplex. In this talk, we use this geometric point of view to study arithmetic progressions of congruences of the form p(sk+r,d) = 0 mod m for all k.

Subscribe to RSS - Restricted Partition