✦ LIBER ✦

The minimum of the antichains in the factor poset

✍ Scribed by Gerard J. Chang; Fred H. Hao

Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 161 KB
Volume: 3
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00340777

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Posets having a unique decomposition int

Posets having a unique decomposition into the minimum number of antichains

✍ Issie Rabinovitch 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 74 KB

Posets having a unique decomposition int

Posets having a unique decomposition into the minimum number of antichains

✍ Issie Rabinovitch 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 126 KB

The convex hull of antichains in posets

✍ P. Frankl 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 181 KB

Computing on-line the lattice of maximal

Computing on-line the lattice of maximal antichains of posets

✍ Guy-Vincent Jourdan; Jean-Xavier Rampon; Claude Jard 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 940 KB

A combinatorial property of the factor p

A combinatorial property of the factor poset of a word

✍ Arturo Carpi; Aldo de Luca 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

We prove the following interesting combinatorial property of the poset of the factors of a word. Let w be a word and n = G w + 2, where G w is the maximal length of a repeated factor of w. If v is any word such that the posets of the factors of v and of w up to length n are isomorphic, then v can be

Every countable poset is embeddable in t

Every countable poset is embeddable in the poset of unsolvable terms

✍ Rick Statman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 216 KB