We form the random poset P P n, p by including each subset of n s 1, . . . , n with probability p and ordering the subsets by inclusion. We investigate the length of the Ε½ . longest chain contained in P P n, p . For p G ern we obtain the limit distribution of this random variable. For smaller p we g
A characterization of finite BOOLEan lattices
β Scribed by Juhani Nieminen
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 250 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Suppose we toss an independent coin with probability of success p for each subset of Β½n ΒΌ f1; . . . ; ng; and form the random hypergraph PΓ°n; pΓ by taking as hyperedges the subsets with successful coin tosses. We investigate the cardinality of the largest Sperner family contained in PΓ°n; pΓ: We obta
In this article, we determine the probability of existence of small lattices in random subsets of a Boolean lattice. Furthermore, we address some Ramsey-and Turan-type questions. Analogous questions have been studied extensively for random graphs, but it turns out that the situation for Boolean lat
## Abstract We study __Ο__βcategorical weakly oβminimal expansions of Boolean lattices. We show that a structure π = (__A__,β€, β) expanding a Boolean lattice (__A__,β€) by a finite sequence __I__ of ideals of __A__ closed under the usual Heyting algebra operations is weakly oβminimal if and only if