Coloring chains
type: Item
instance of: scholarly article
title: Coloring chains
zbMATH Open document ID: 0689.06001
DOI: 10.1007/BF00341638
author: Dwight Duffus
author: R. E. Woodrow
author: Robert Bonnet
published in: Order
publication date: 1989-01-01T00:00:00Z
review text: 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}}\).
reviewed by: Philippe Vincke
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 4128858
zbMATH Keywords: scattered chain
zbMATH Keywords: nonscattered chain
zbMATH Keywords: linear orderings
zbMATH Keywords: principal final segments
zbMATH Keywords: countable chains
zbMATH Keywords: colorings
zbMATH Keywords: rational chain
zbMATH Keywords: color-isomorphic
MaRDI profile type: Publication
cites work: Q3949052
full work available at URL: https://doi.org/10.1007/bf00341638
OpenAlex ID: W4242365437
description: scientific article; zbMATH DE number 4128858