𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Explicit matchings in the middle levels of the Boolean lattice

✍ Scribed by H. A. Kierstead; W. T. Trotter

Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
542 KB
Volume
5
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The dimension of two levels of the Boole
The dimension of two levels of the Boolean lattice
✍ H.A. Kierstead πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 690 KB

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.

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