Article
Licensed
Unlicensed
Requires Authentication
Approximation of automorphisms of the rationals and the random graph
-
U. B. Darji
and
J. D. Mitchell
Published/Copyright:
October 13, 2010
Abstract
Let G be the group of order-preserving automorphisms of the rationals ℚ, or the group of colour-preserving automorphisms of the 
-coloured random graph 
. We show that given any non-identity ƒ ∈ G, there exists g ∈ G such that every automorphism in G is the limit of a sequence of automorphisms generated by ƒ and g. Moreover, if, in some sense, ƒ has no finite structure, then g can be chosen with a great deal of flexibility.
Received: 2009-12-18
Revised: 2010-06-23
Published Online: 2010-10-13
Published in Print: 2011-May
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On Lyndon's equation in some Λ-free groups and HNN extensions
- On triple factorizations of finite groups
- Approximation of automorphisms of the rationals and the random graph
- Bass–Serre theory and counting rank two amalgams
- Rational defect groups and 2-rational characters
- The imprimitive faithful complex characters of the Schur covers of the symmetric and alternating groups
- Real and strongly real classes in SLn(q)
- Real and strongly real classes in PGLn(q) and quasi-simple covers of PSLn(q)
Articles in the same Issue
- On Lyndon's equation in some Λ-free groups and HNN extensions
- On triple factorizations of finite groups
- Approximation of automorphisms of the rationals and the random graph
- Bass–Serre theory and counting rank two amalgams
- Rational defect groups and 2-rational characters
- The imprimitive faithful complex characters of the Schur covers of the symmetric and alternating groups
- Real and strongly real classes in SLn(q)
- Real and strongly real classes in PGLn(q) and quasi-simple covers of PSLn(q)
