Abstract:We study integer partitions in a probabilistic setup. In the first part of the talk, we state and strengthen a result of Erdos that concerns the repeatability of summands in a uniformly distributed random integer partition.

In the second part of the talk, we study the number of ways a random Ferrer diagram can be dismantled. We provide tight bounds for the minimum number of planes needed to dismantle a uniformly distributed Ferrer diagram.