Extensions of set partitions
β Scribed by Norman Lindquist; Gerard Sierksma
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 345 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Partitions of n-sets and their associated Bell and Stirling numbers are wellstudied combinatorial entities. Less studied is the connection between these entities and the moments of a Poisson random variable. We find a natural generalization of this connection by considering the moments of the circul
Denote by GΓP the graph which has vertex set [X 1 , ..., X n ], edge set E, and is obtained from G by identifying vertices in each class X i of the partition P. Given a conservative graph (G, w), we study vertex set partitions preserving conservativeness, i.e., those for which (GΓP, w) is also a con
We study the asymptotics of subset counts for the uniformly random partition of the set [n]. It is known that typically most of the subsets of the random partition are of size r, with re r =n. Confirming a conjecture formulated by Arratia and Tavare , we prove that the counts of other subsets are cl