Chaines alternées. (Alternating chains) (Q1066925)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chaines alternées. (Alternating chains) |
scientific article; zbMATH DE number 3926982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chaines alternées. (Alternating chains) |
scientific article; zbMATH DE number 3926982 |
Statements
Chaines alternées. (Alternating chains) (English)
0 references
1985
0 references
Let P be a poset and A a fixed subset of P. A chain \(C\subseteq P\) is said to be alternating if for every two distinct elements a,b of C there exist elements c,d in C between a and b, such that A separates each of the pairs a,c and b,d. It is proved that the following conditions are equivalent: (i) A is a Boolean combination of final segments (i.e., increasing subsets) of P; (ii) the lengths of alternating chains are bounded. If, moreover, P has no infinite antichain, then the above conditions are also equivalent to the following one: (iii) there is no infinite alternating chain.
0 references
poset
0 references
Boolean combination of final segments
0 references
lengths of alternating chains
0 references
0.7767122983932495
0 references
0.7324450612068176
0 references
0.7200369238853455
0 references