2000 character limit reached
Subgroup Separability of Artin Groups
Published 25 Oct 2020 in math.GR | (2010.13222v4)
Abstract: We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2 via a finite sequence of free products and direct products with the infinite cyclic group. This result generalizes the Metaftsis-Raptis criterion for Right-Angled Artin groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.