Gaps in integer partitions

Abstract

We study the gaps or missing part sizes in partition of integers. For a random partition of an integer n we consider the average sizes of the largest gap and the total number of gaps. We show that the largest gap grows asymptotically at the same rate as the largest part in a partition and that the number of gaps grows with order √n.