SearcharxivSearch

arXiv · math/0406443

A finitely presented group with unbounded dead-end depth

Abstract

The dead-end depth of an element g of a group G, with respect to a generating set A is the distance from g to the complement of the radius $d_A(1,g)$ closed ball, in the word metric $d_A$ defined with respect to A. We exhibit a finitely presented group G with a finite generating set with respect to which there is no upper bound on the dead-end depth of elements. The authors regret that the published version of this article (Proc. Amer. Math. Soc., 134(2), pp.343-349, 2006) contains a significant error concerning the model for G described in Section 2. We are grateful to Jorg Lehnert for pointing out our mistake. In this corrected version, that model has been overhauled, and that has necessitated a number of changes in the subsequent arguments.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Cleary, Tim R. Riley. 2007-04-10. A finitely presented group with unbounded dead-end depth. https://arxiv.org/abs/math/0406443

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