Article contents
Shuffling of Linear Orders
Published online by Cambridge University Press: 20 November 2018
Abstract
A linearly ordered set A is said to shuffle into another linearly ordered set B if there is an order preserving surjection A —> B such that the preimage of each member of a cofinite subset of B has an arbitrary pre-defined finite cardinality. We show that every countable linearly ordered set shuffles into itself. This leads to consequences on transformations of subsets of the real numbers by order preserving maps.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1995
References
- 1
- Cited by