✦ LIBER ✦

The dimension of two levels of the Boolean lattice

✍ Scribed by H.A. Kierstead

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 690 KB
Volume: 201
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00316-1

No coin nor oath required. For personal study only.

✦ Synopsis

Let B(j,k; n) be the ordered set obtained by ordering the j element and k element subsets of an n element set by inclusion. We review results and proof techniques concerning the dimension dim(j,k;n) of B (j,k;n) for various ranges of the arguments j, k, and n.

📜 SIMILAR VOLUMES

The fractional dimension of subsets of B

The fractional dimension of subsets of Boolean lattices and of cartesian products

✍ Utz Leimich; Klaus Reuter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 582 KB

The global dimension of Boolean rings

✍ R.S Pierce 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The length of random subsets of Boolean

The length of random subsets of Boolean lattices

✍ Y. Kohayakawa; B. Kreuter; D. Osthus 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 3 views

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

The Width of Random Subsets of Boolean L

The Width of Random Subsets of Boolean Lattices

✍ Y. Kohayakawa; B. Kreuter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

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

Generating sets for lattices of dimensio

Generating sets for lattices of dimension two

✍ Bill Sands 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 596 KB

The dimension of a partially ordered set P is the smallest integer n (if it exists) such that the partial order on P is the intersection of n linear orders. It is shown that if L is a lattice of dimension two containing a sublattice isomorphic to the modular Iatiice Mz,+,, then every generating set

On the f-vectors of Cutsets in the Boole

On the f-vectors of Cutsets in the Boolean Lattice

✍ Matthew Haines; Shahriar Shahriari 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A cutset in the poset 2 [n] , of subsets of [1, ..., n] ordered by inclusion, is a subset of 2 [n] that intersects every maximal chain. Let 0 : 1 be a real number. Is it possible to find a cutset in 2 [n] that, for each 0 i n, contains at most : ( n i ) subsets of size i ? Let :(n) be the greatest l