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

DOI10.1016/0097-3165(85)90066-4zbMath0575.05005OpenAlexW1965393258MaRDI QIDQ1063598

Andrew M. Odlyzko, L. Bruce Richmond

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90066-4

zbMATH Keywords

partitiondistinct block sizes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (9)

Gap‐Free Set Partitions ⋮ Random set partitions: Asymptotics of subset counts ⋮ Limiting distributions for the number of distinct component sizes in relational structures ⋮ Upper bounds on the average number of colors in the non-equivalent colorings of a graph ⋮ Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph ⋮ Erratum to ``Limiting distributions for the number of distinct component sizes in relational structures ⋮ Unnamed Item ⋮ A Random Graph With a Subcritical Number of Edges ⋮ Three problems in combinatorial asymptotics

Cites Work

• Unnamed Item
• Three problems in combinatorial asymptotics
• Central and local limit theorems applied to asymptotic enumeration
• On the maximum of Stirling numbers of the second kind
• A Generalisation of Stirling's Formula.

This page was built for publication: On the number of distinct block sizes in partitions of a set