Journal of Group Theory
Editor-in-Chief: Parker, Christopher W. / Wilson, John S.
Managing Editor: Khukhro, Evgenii I. / Kramer, Linus
6 Issues per year
IMPACT FACTOR 2016: 0.457
5-year IMPACT FACTOR: 0.521
CiteScore 2016: 0.53
SCImago Journal Rank (SJR) 2016: 0.673
Source Normalized Impact per Paper (SNIP) 2016: 1.049
Mathematical Citation Quotient (MCQ) 2016: 0.43
Approximation of automorphisms of the rationals and the random graph
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.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.