SearcharxivSearch

arXiv · 2608.30879

Conjugator Lengths and Isoperimetric functions

Abstract

We show that for any recognizing $S$-machine $\textbf{S}$ with superadditive time function $f$, there exists a finitely presented group whose conjugator length function is quadratic and whose Dehn function grows like the square of $f$. This result is dual to that of a previous paper of the authors, which constructed a family of groups with cubic Dehn function that have various conjugator length functions. We thereby give the first known example of a finitely presented group whose conjugator length function is recursive, but whose Word and Conjugacy Problems are both undecidable. This answers an analogue of a question of Rips. Moreover, given a finitely presented group $G$ with decidable Word Problem, we obtain a finitely presented group with decidable Conjugacy Problem whose Dehn function grows faster than that of $G$. Finally, combining this result with its dual, for a wide array of pairs of functions $(f,g)$ we furnish an example of a finitely presented group with Dehn function equivalent to $f$ and conjugator length function equivalent to $g$. This shows that the two invariants are very strongly independent and making significant progress on a question of Bridson, Riley, and Sale.

Explore related subjects

Keep this discovery

BibTeXRIS

Conan Gillis, Francis Wagner. 2026-08-31. Conjugator Lengths and Isoperimetric functions. https://arxiv.org/abs/2608.30879

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