✦ LIBER ✦

Two representations of finite ordered sets

✍ Scribed by A. Batbedat

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 624 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0124-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite partially ordered sets of cohomol

Finite partially ordered sets of cohomological dimension one

✍ Charles Ching-an Cheng 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Primary Orders of Finite Representation

Primary Orders of Finite Representation Type

✍ Hiroaki Hijikata; Kenji Nishida 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Recall the well-known theorem of Drozd and Kirichenko cf. Yu. A. Drozd and Ž . . V. V. Kirichenko, Math. USSR Iz¨estia 7 1973 , 711᎐732 giving a necessary and sufficient condition for a primary order ⌳ to be of finite representation type. Such Ž . ⌳s that satisfy the ''necessary condition'' of the D

A Brylawski decomposition for finite ord

A Brylawski decomposition for finite ordered sets

✍ Richard P. Stanley 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 495 KB

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 partic

Decompositions of Modules Associated to

Decompositions of Modules Associated to Finite Partially Ordered Sets

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

Extensions of ordered sets having the fi

Extensions of ordered sets having the finite cutset property

✍ John Ginsburg 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being c

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