Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-23T02:19:14.289Z Has data issue: false hasContentIssue false
  • English
  • Français

Groups of automorphisms of linearly ordered sets

Published online by Cambridge University Press:  17 April 2009

J.L. Hickman
J.L. Hickman
Affiliation:
Department of Mathematics, Institute of Advanced Studies, Australian National University, Canberra, ACT.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

I show that a group of order-automorphisms of a linearly ordered set can be expressed as an unrestricted direct product in which each factor is either the infinite cyclic group or else a group of order-automorphisms of a densely ordered set. From this a couple of simple group embedding theorems can be derived. The technique used to obtain the main result of this paper was motivated by the Erdös-Hajnal inductive classification of scattered sets.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 15 , Issue 1 , August 1976 , pp. 13 - 32
Copyright
Copyright © Australian Mathematical Society 1976

References

[1]Cohn, P.M., “Groups of order automorphisms of ordered sets”, Mathematica 4 (1957), 41–50.Google Scholar
[2]Erdös, P. and Hajnal, A., “On a classification of denumerable order types and an application to the partition calculus”, Fund. Math. 51 (1962), 117–129.CrossRefGoogle Scholar
[3]Holland, Charles, “The lattice-ordered group of automorphisms of an ordered set”, Michigan Math. J. 10 (1963), 399–408.CrossRefGoogle Scholar
[4]Levi, F.W., “Ordered groups”, Proc. Nat. Acad. Sci. India 16 (1942), 256–263.CrossRefGoogle Scholar
[5]Neumann, B.H., “On ordered groups”, Amer. J. Math. 71 (1949), 1–18.CrossRefGoogle Scholar