Abstract
This paper contains a classification of countable lower 1-transitive linear orders. This is the first step in the classification of countable 1-transitive trees given in Chicot and Truss (2009): the notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and it is essential for the structure theory of 1-transitive trees. The classification is given in terms of coding trees, which describe how a linear order is fabricated from simpler pieces using concatenations, lexicographic products and other kinds of construction. We define coding trees and show that a coding tree can be constructed from a lower 1-transitive linear order \((X, \leqslant )\) by examining all the invariant partitions on X. Then we show that a lower 1-transitive linear order can be recovered from a coding tree up to isomorphism.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Campero-Arena, G.: Transitivity properties of countable coloured orderings. Ph.D. thesis, Department of Pure Mathematics, University of Leeds (2002)
Campero-Arena, G., Truss, J.: Countable 1-transitive coloured linear orderings II. Fund. Math. 183, 185–213 (2004)
Chicot, K., Truss, J.: Countable 1-transitive trees. In: Droste, M., Fuchs, L., Goldsmith, B., Strüngmann, L. (eds.) Groups, Modules and Model Theory - Surveys and Recent Developments, in Memory of Rüdiger Göbel. To appear. Springer (2009)
Davey, B., Priestley, H.: Introduction to lattices and order. Cambridge University Press, Cambridge (2002)
Droste, M.: Structure of partially ordered sets with transitive automorphism groups. Mem. Amer. Math. Soc. 57(334) (1985)
Droste, M., Holland, W., Macpherson, H.: Automorphism groups of infinite semilinear orders (I and II). Proc. Lond. Math. Soc. 58, 454–494 (1989)
Morel, A.: A class of relation types isomorphic to the ordinals. The Michigan Mathematical Journal 12, 203–215 (1965)
Acknowledgments
The authors wish to thank John Truss and Dugald Macpherson for their extensive help. We are also grateful to the anonymous referees for thorough and thoughtful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
The results in this paper form part of the second author’s PhD thesis at the University of Leeds, which was supported by EPSRC grant EP/H00677X/1.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Barbina, S., Chicot, K. A Classification of Countable Lower 1-transitive Linear Orders. Order 35, 215–231 (2018). https://doi.org/10.1007/s11083-017-9427-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-017-9427-2