On the number of distinct block sizes in partitions of a set

A. M. Odlyzko, L. B. Richmond

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

The average number of distinct block sizes in a partition of a set of n elements is asymptotic to e log n as n → ∞. In addition, almost all partitions have approximately e log n distinct block sizes. This is in striking contrast to the fact that the average total number of blocks in a partition is ∼n(log n)-1 as n → ∞.

Original languageEnglish (US)
Pages (from-to)170-181
Number of pages12
JournalJournal of Combinatorial Theory, Series A
Volume38
Issue number2
DOIs
StatePublished - Mar 1985
Externally publishedYes

Fingerprint Dive into the research topics of 'On the number of distinct block sizes in partitions of a set'. Together they form a unique fingerprint.

Cite this