2000 character limit reached
Rigidity and classification results for large-type Artin groups
Published 29 Jul 2024 in math.GR, math.GT, and math.OA | (2407.19940v1)
Abstract: We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of rigidity and classification results for these groups, including computation of outer automorphism groups, commensurability classification, quasi-isometric rigidity, measure equivalence rigidity, orbit equivalence rigidity, rigidity of lattice embedding, and rigidity of cross-product von Neumann algebra.
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.