The asymptotic behavior of the number of set partitions of an n-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are used to obtain most of the results. Simultaneously, we obtain results on the shape of a random partition of an n-element set into blocks of distinct sizes.
|Original language||English (US)|
|Journal||Electronic Journal of Combinatorics|
|State||Published - Dec 1 1999|