On the genericity of loxodromic actions

Bert Wiest

Home/Archive/arXiv

arXiv · 1406.7041

On the genericity of loxodromic actions

Bert Wiest

View original source ↗Read source document ↗Export metadata ↓

Abstract

One way of picking a "generic" element of a finitely generated group is to pick a random element with uniform probability in a large ball centered on $1$ in the Cayley graph. If the group acts on a $\delta$-hyperbolic space, with at least one element acting loxodromically, then it is plausible that generic elements should act loxodromically with high probability. In this paper we prove that the probability of acting loxodromically is bounded away from 0, provided the group satisfies a very weak automaticity condition, and provided a certain compatibility condition linking the automatic with the $\delta$-hyperbolic structure is satisfied. We present several applications of this result, including the genericity of pseudo-Anosov braids.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Bert Wiest. 2014-06-26. On the genericity of loxodromic actions. https://arxiv.org/abs/1406.7041

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗