SearcharxivSearch

arXiv · 2506.01235

The lengths of conjugators in the model filiform groups

Abstract

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We prove that polynomials of arbitrary degree arise as conjugator length functions of finitely presented groups. To establish this, we analyse the geometry of conjugation in the discrete model filiform groups $\Gamma_d = \mathbb{Z}^d\rtimes_\phi\mathbb{Z}$ where is $\phi$ is the automorphism of $\mathbb{Z}^d$ that fixes the last element of a basis $a_1,\dots,a_d$ and sends $a_i$ to $a_ia_{i+1}$ for $i<d$. The conjugator length function of $\Gamma_d$ is polynomial of degree $d$.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin R. Bridson, Timothy R. Riley. 2025-06-02. The lengths of conjugators in the model filiform groups. https://arxiv.org/abs/2506.01235

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