SearcharxivSearch

arXiv · 2403.05483

Subgroup Separability of Artin Groups II

Abstract

In this paper, we establish a new criterion for determining whether an Artin group is subgroup separable (LERF), building upon a criterion introduced in a previous work. Specifically, we prove an Artin group is LERF if and only if it does not contain certain induced subgraphs, thus providing a more direct generalization of the Metaftsis-Raptis criterion for RAAGs. As consequences, we prove an Artin group is ERF if and only if it is a free abelian group and we establish a link between subgroup separability and coherence for Artin groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Kisnney Almeida, Igor Lima. 2024-03-08. Subgroup Separability of Artin Groups II. https://arxiv.org/abs/2403.05483

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