Monday January 26, 2004

Speaker: Rajesh Ravindran (Brandeis)

Title: Plane and solid partitions of an integer

Abstract: Partitions of an integer is the number of ways a positive integer can be decomposed into sum of smaller parts. Depending on the dimension of the lattice on which these parts are arranged, the partitions are called linear partitions, plane partitions, solid partitions and so on. In this talk I will discuss a simple combinatorial proof for the MacMahon formula for the plane partitions of an integer. Numerical results for the asymptotic behaviour of solid partitions will also be discussed.