✦ LIBER ✦

Partitioning Boolean lattices into antichains

✍ Scribed by Muktar Elzobi; Zbigniew Lonc

Book ID: 108315779
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 125 KB
Volume: 260
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00448-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning Boolean lattices into chain

Partitioning Boolean lattices into chains of subsets

✍ Jerrold R. Griggs; Roger K. -C. Yeh; Charles M. Grinstead 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 167 KB

Maximal Chains and Antichains in Boolean

Maximal Chains and Antichains in Boolean Lattices

✍ Duffus, D.; Sands, B.; Winkler, P. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 953 KB

Partitioning bases of Boolean lattices

✍ Robert W. Quackenbush; Hans-Christian Reichel 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 51 KB

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ü

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

The Size of the Largest Antichain in the

The Size of the Largest Antichain in the Partition Lattice

✍ E.Rodney Canfield 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Consider the poset 6 n of partitions of an n-element set, ordered by refinement. The sizes of the various ranks within this poset are the Stirling numbers of the second kind. Let a= 1 2 &e log(2)Â4. We prove the following upper bound for the ratio of the size of the largest antichain to the size of