SearcharxivSearch

arXiv · 2510.20923

Conjugacy languages and conjugacy growth relative to subsets of groups

Abstract

In this paper, we explore conjugacy languages when the base problem is the generalized conjugacy problem (with constraints): given $g\in G$ and $U\subset G$, does $g$ have a conjugate in $U$ (with conjugators in a certain subset)? To do so, for subsets $U,V\subseteq G$, we define the corresponding languages $\text{ConjGeo(U,V)}$, $\text{CycGeo(U)}$, $\text{ConjSL(U)}$ and $\text{ConjMinLenSL(U,V)}$, following the previously studied cases where $U=V=G$. Our results cover several classes of groups: for free groups, we prove that $\text{ConjGeo(U,V)}$ and $\text{ConjMinLenSL(U,V)}$ are regular if $U$ and $V$ are rational subsets; for hyperbolic groups, we show that if $L$ is a regular language of geodesics and $U$ is the subsets represented by it, then $\text{ConjGeo(U)}$ and $\text{ConjMinLenSL(U)}$ are regular; for virtually cyclic groups, we show that $\text{ConjSL(U)}$ is regular if $U$ is rational; and, for virtually abelian groups, we prove that $\text{ConjGeo(U)}$ belongs to a certain class of languages $\C$ when the language of words representing elements of $U$ also belongs to $\C$. We also define relative conjugacy growth and show that its behavior can be heavily dependent on the choice of subset.

Explore related subjects

Keep this discovery

BibTeXRIS

André Carvalho, Ana-Catarina C. Monteiro. 2025-10-23. Conjugacy languages and conjugacy growth relative to subsets of groups. https://arxiv.org/abs/2510.20923

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