On the number of distinct block sizes in partitions of a set
type: Item
instance of: scholarly article
title: On the number of distinct block sizes in partitions of a set
zbMATH Open document ID: 0575.05005
DOI: 10.1016/0097-3165(85)90066-4
author: Andrew Odlyzko
author: L. Bruce Richmond
published in: Journal of Combinatorial Theory. Series A
publication date: 1985-01-01T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 05A17
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 3918370
zbMATH Keywords: distinct block sizes
zbMATH Keywords: partition
MaRDI profile type: Publication
full work available at URL: 0097-3165(85)90066-4
OpenAlex ID: W1965393258
cites work: Central and local limit theorems applied to asymptotic enumeration
cites work: Q3250680
cites work: A Generalisation of Stirling's Formula.
cites work: On the maximum of Stirling numbers of the second kind
cites work: Three problems in combinatorial asymptotics
description: scientific article; zbMATH DE number 3918370