SearcharxivSearch

arXiv · 1802.03089

The geometry of generalized loxodromic elements

Abstract

We explore geometric conditions which ensure a given element of a finitely generated group is, or fails to be, generalized loxodromic; as part of this we prove a generalization of Sisto's result that every generalized loxodromic element is Morse. We provide a sufficient geometric condition for an element of a small cancellation group to be generalized loxodromic in terms of the defining relations and provide a number of constructions which prove that this condition is sharp.

Explore related subjects

Keep this discovery

BibTeXRIS

Carolyn R. Abbott, David Hume. 2018-02-09. The geometry of generalized loxodromic elements. https://arxiv.org/abs/1802.03089

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