Suresh Govindarajan:  Partitions of integers and
		their higher-dimensional generalisations
	Chair: Rajesh Ravindran

	Abstract: Partitions of integers and their higher-dimensional
	generalisations (such as plane/solid partitions) appear in a
	variety of counting problems in mathematics, physics and computer
	science. In this talk, after defining and illustrating partitions,
	we will discuss the various methods used to enumerate them. We will
	then discuss their asymptotic behaviour and an exact formula
	of Hardy-Ramanujan-Rademacher (HRR) for partitions. We then show that
	there is a HRR-type formula for plane partitions that is asymptotic.
	Finally, we show that treating partitions in all dimensions on the
	same footing leads to a surprising result that one needs [(n-1)/2]
	numbers (rather than (n-1) numbers) to determine the partitions
	of a positive integer n in all dimensions.  

	References:  The Partitions Project at IIT Madras:
	http://boltzmann.wikidot.com/the-partitions-project

	S. Govindarajan, Notes on higher-dimensional partitions
	arXiv:1203.4419 [math.CO] 
	J.~of Combinatorial Theory, Series~A 120 (3) (2013) 600-622

	S. Govindarajan and N. S. Prabhakar, arXiv:1311.7227 [math.NT]
	A superasymptotic formula for the number of plane partitions