Generating automorphism groups of chains

From MaRDI portal





Let \((\Omega,\leq)\) be a totally ordered set and \(\Aut(\Omega,\leq)=\Aut(\Omega)\) the group of all order preserving permutations of \((\Omega,\leq)\). Then \((\Omega,\leq)\) is said to be doubly homogeneous if for every \(a_1,a_2,b_1,b_2\in\Omega\) such that \(a_1<a_2\) and \(b_1<b_2\), there is \(g\in\Aut(\Omega)\) such that \(g(a_1)=b_1\) and \(g(a_2)=b_2\) (as examples, consider the sets of rationals \((\mathbb{Q},\leq)\) or reals \((\mathbb{R},\leq)\) with their usual order). In this paper the authors show that if \(J\) is a set of generators of \(\Aut(\Omega)\), then there is a positive integer \(n\) such that every element of \(\Aut(\Omega)\) is a product of at most \(n\) members of \(J\cup J^{-1}\). Also \(\Aut(\Omega)\) cannot be written as the union of a countable chain of proper subgroups of \(\Aut(\Omega)\).




Cited in
(35)








This page was built for publication: Generating automorphism groups of chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692986)