Threshold Functions for Distinct Parts: Revisiting Erdős–Lehner
From MaRDI portal
Publication:4915251
DOI10.1007/978-3-642-36899-8_22zbMath1377.05012arXiv1209.5764OpenAlexW1560935118MaRDI QIDQ4915251
Éva Czabarka, László A. Székely, Matteo Marsili
Publication date: 9 April 2013
Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5764
threshold functionrandom functionrandom integer partitionrandom integer compositioninteger composition with distinct partsinteger partition with distinct partsrandom set partitionset partition with distinct class sizes
Related Items
The total acquisition number of the randomly weighted path, Universal and near-universal cycles of set partitions
Cites Work
- The asymptotic number of set partitions with unequal block sizes
- The distribution of the number of summands in the partitions of a positive integer
- Expected Number of Distinct Part Sizes in a Random Integer Composition
- Elements of Information Theory
- Partition Asymptotics from Recursion Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item