SearcharxivSearch

arXiv · math/0009101

The surjectivity problem for one-generator,, one-relator extensions of torsion-free groups

Abstract

We use Klyachko's methods to prove that the natural map G to G-hat, where G is a torsion-free group and G-hat is obtained by adding a new generator t and a new relator w, is surjective only if w is conjugate to gt or gt^{-1} for some g in G. This solves a special case of the surjectivity problem for group extensions, raised by Cohen [Whitehead torsion, group extensions, and Zeeman's conjecture in high dimensions, Topology, 16 (1977) 79--88].

Explore related subjects

Keep this discovery

BibTeXRIS

Marshall M Cohen, Colin Rourke. 2000-09-10. The surjectivity problem for one-generator,, one-relator extensions of torsion-free groups. https://doi.org/10.2140/gt.2001.5.127

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