2000 character limit reached
Profinite properties of RAAGs and special groups
Published 23 Mar 2016 in math.GT and math.GR | (1603.07197v1)
Abstract: In this paper we prove that RAAGs are distinguished from each other by their pro-$p$ completions for any choice of prime $p$, and that RACGs are distinguished from each other by their pro-2 completions. We also give a new proof that hyperbolic virtually special groups are good in the sense of Serre. Furthermore we give an example of a property of the underlying graph of a RAAG that translates to a property of the profinite completion.
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.