Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T10:20:08.675Z Has data issue: false hasContentIssue false

Deciding if an automorphism of an infinite soluble group is inner

Published online by Cambridge University Press:  18 May 2009

Derek J. S. Robinson
Affiliation:
Department of Mathematics, University of Illinoisin Urbana-Champaign, Urbana, Illinois, USA
Rights & Permissions [Opens in a new window]

Extract

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.

Let G be a group with a finite set of generators x1, x2,…,xn and a recursive set of defining relators in the generators. Then an endomorphism η of G is completely determined by the images of the generators , and hence by the n-tuple of words in x, (w1,…,wn). This allows the formulation of algorithmic problems about endomorphisms and automorphisms. For example, can one decide if a given n-tuple of words represents an endomorphism, and if so, an automorphism? Some results on these questions may be found in [2] and [12]. Here we shall be concerned with a similar problem: given that an n-tuple of words represents an automorphism of the group G, does there exist an algorithm which decides if the automorphism is inner?

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1990