๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generation of a random partition of a finite set by an urn model

โœ Scribed by A.J Stam

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
427 KB
Volume
35
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Common transversals for partitions of a
Common transversals for partitions of a finite set
โœ T.C. Brown ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 725 KB

For ~22, ta?, let A, ,..., 4 be s-cell partitions of a finite set X. Assume that if x, y E X7 x # y, then x, y belong to different cells of at least one of the part&ons 4. For each k > 1, let c(s, t, k) be the least integer such that if A 1,. . . ., 4 X satisfy the preceding conditions, and the smal

Maximum Antichains in Random Subsets of
Maximum Antichains in Random Subsets of a Finite Set
โœ Deryk Osthus ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p