SearcharxivSearch

arXiv · 2407.13870

Effective conjugacy separability of virtually abelian groups

Abstract

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that $\varphi(h)\notin\varphi(X)$. More specifically, a group is said to be conjugacy separable if every conjugacy class is separable. It is known that many classes of groups are conjugacy separable, including virtually free and polycyclic groups. The minimal order of the quotient $Q$, in terms of the complexity of the conjugacy classes under consideration, is captured by the conjugacy separability function $\mathrm{Conj}_H: \mathbb{N} \to \mathbb{N}$. This function is in general ill understood, in fact the only large class of groups for which it is known exactly are the abelian groups. Indeed, in this case $\mathrm{Conj}_H$ is equal to the residual finiteness function, that is the size of quotients needed to separate singletons, and thus logarithmic if the group is infinite. Recent work has described the residual finiteness function for the class of virtually abelian groups, which gives a lower bound for the conjugacy separability function. The main result of this paper is a characterization of $\mathrm{Conj}_H$ for every virtually abelian group $H$. If the corresponding extension is associated with an irreducible representation over $\mathbb{Q}$, we demonstrate that we obtain the same function as the residual finiteness function. However, if the representation is not irreducible, we find an expression that is in some cases strictly larger, which we illustrate with several examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonas Deré, Lukas Vandeputte. 2024-07-18. Effective conjugacy separability of virtually abelian groups. https://arxiv.org/abs/2407.13870

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