Coloring chains (Q1264160)
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: Coloring chains |
scientific article; zbMATH DE number 4128858
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring chains |
scientific article; zbMATH DE number 4128858 |
Statements
Coloring chains (English)
0 references
1989
0 references
The problem is to characterize those chains (linear orderings) C having a first and second element and with all principal final segments isomorphic to C. A description is obtained in the countable scattered case. For nonscattered countable chains, the problem is the same as the following: Characterize the colorings of the rational chain \({\mathbb{Q}}\) such that every open principal final segment of \({\mathbb{Q}}\) is color-isomorphic to \({\mathbb{Q}}\).
0 references
scattered chain
0 references
nonscattered chain
0 references
linear orderings
0 references
principal final segments
0 references
countable chains
0 references
colorings
0 references
rational chain
0 references
color-isomorphic
0 references