Periodic ordered permutation groups and cyclic orderings
It is shown that periodic ordered permutation groups satisfying certain extra conditions are very nearly simple. This is applied to several natural examples, such as the following. (i) If \(z\) denotes the map \(x \mapsto x + 1\) on \(\mathbb{R}\), and \(\text{Diff}(\mathbb{R})\) is the group of diffeomorphisms of \(\mathbb{R}\), then \(C_{\text{Diff}(\mathbb{R})}(\langle z \rangle)/\langle z \rangle\) is simple. (ii) The automorphism group of the countable homogeneous local order (one of the three countable homogeneous tournaments) is simple. Also, an extension of Rieger's Theorem is given, relating groups of automorphisms of cyclic orderings to groups of automorphisms of total orderings.
- 1-transitive cyclic orderings
- On monotone permutations of`ℓ-cyclically ordered sets
- Commutators in groups of order-preserving permutations
- scientific article; zbMATH DE number 6963894 (Why is no real title available?)
- On half cyclically ordered groups
- scientific article; zbMATH DE number 4187889 (Why is no real title available?)
- On cyclically ordered groups
- Minimality conditions, topologies, and ranks for spherically ordered theories
- Exponentiable linear orders need not be transitive
- Permutations over cyclic groups
This page was built for publication: Periodic ordered permutation groups and cyclic orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892849)