✦ LIBER ✦

A Brylawski decomposition for finite ordered sets

✍ Scribed by Richard P. Stanley

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 495 KB
Volume: 4
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90117-9

No coin nor oath required. For personal study only.

✦ Synopsis

Abstmct# A decomposition is given for fini*.e ordered sets P and is shown to bc a unique decomposition in the sense of Brylawski. Hence there exists a universal invariant g(P) for this decomposition, and we c(Dmpute g(P) explicitly. Some modifications of this decomposition are considered; in particular, one which forms a bidecomposition toecther with disjoint union.

📜 SIMILAR VOLUMES

A Ramsey theoretic problem for finite or

A Ramsey theoretic problem for finite ordered sets

✍ H.A. Kierstead; W.T. Trotter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 467 KB

In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic

Two representations of finite ordered se

Two representations of finite ordered sets

✍ A. Batbedat 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Decompositions of Modules Associated to

Decompositions of Modules Associated to Finite Partially Ordered Sets

✍ Johannes Siemons 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 139 KB

A Tutte Polynomial for Partially Ordered

A Tutte Polynomial for Partially Ordered Sets

✍ G. Gordon 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 930 KB

A separation decomposition for orders

✍ Thomas Kämpke 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

## Abstract Several decomposition types of orders and related discrete structures have been investigated so far. In this paper, we present a decomposition for orders based on partial “ignoring” of the order. Structures that are in a certain sense “prime” turn out to be decomposable. The relation to

A decomposition theorem for χ1-convex se

A decomposition theorem for χ1-convex sets

✍ Marilyn Breen 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 830 KB

A set S in 1 :" is said to he X,-convex if and only if S does not contain a visually independent subset having cardinality h', . It is natural tts ask when an h',-convex set may be expressed as a countable unI.,n of convex sets. Here i! is proved that if S is a closed h',-convex set in the plane and