On the number of distinct block sizes in partitions of a set (Q1063598)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of distinct block sizes in partitions of a set |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of distinct block sizes in partitions of a set |
scientific article |
Statements
On the number of distinct block sizes in partitions of a set (English)
0 references
1985
0 references
It is proved that the average number of distinct block sizes in a partition of a set of n elements is asymptotic to e log n as \(n\to \infty\) and almost all partitions have approximately e log n distinct block sizes. It is well known that the average total number of blocks in a partition is \(\sim\) n/log n as \(n\to \infty\).
0 references
distinct block sizes
0 references
partition
0 references
