𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning bases of Boolean lattices

✍ Scribed by Robert W. Quackenbush; Hans-Christian Reichel

Book ID
112760424
Publisher
Springer
Year
1975
Tongue
English
Weight
51 KB
Volume
5
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitions of large Boolean lattices
Partitions of large Boolean lattices
✍ Zbigniew Lonc πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 482 KB

Let 2" be the ordered set obtained from the Boolean lattice 2" by deleting both the greatest and the least elements. Definef(n) to be the minimum number k such that there is a partition of 2" into k antichains of the same size except for at most one antichain of a smaller size. In the paper we exami

Partitioning the Boolean Lattice into Ch
Partitioning the Boolean Lattice into Chains of Large Minimum Size
✍ Tim Hsu; Mark J. Logan; Shahriar Shahriari; Christopher Towse πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

Let 2 [n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, ..., n} ordered by inclusion. Recall that 2 [n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of FΓΌ

Cutsets of Boolean lattices
Cutsets of Boolean lattices
✍ Richard Nowakowski πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 575 KB

Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F U {a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined