SearcharxivSearch

arXiv · math/9802094

Automorphisms of one-relator groups

Abstract

It is a well-known fact that every group $G$ has a presentation of the form $G = F/R$, where $F$ is a free group and $R$ the kernel of the natural epimorphism from $F$ onto $G$. Driven by the desire to obtain a similar presentation of the group of automorphisms $Aut(G)$, we can consider the subgroup $Stab(R) \subseteq Aut(F)$ of those automorphisms of $F$ that stabilize $R$, and try to figure out if the natural homomorphism $Stab(R) \to Aut(G)$ is onto, and if it is, to determine its kernel. Both parts of this task are usually quite hard. The former part received considerable attention in the past, whereas the latter, more difficult, part (determining the kernel) seemed unapproachable. Here we approach this problem for a class of one-relator groups with a special kind of small cancellation condition. Then, we address a somewhat easier case of 2-generator (not necessarily one-relator) groups, and determine the kernel of the above mentioned homomorphism for a rather general class of those groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Shpilrain. 1998-02-19. Automorphisms of one-relator groups. https://doi.org/10.1017/s0305004198003478

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR