Quasi-isometry classification of certain graph 2-braid groups and its applications
Abstract
In Oh22, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an intersection complex, which is a quasi-isometry invariant. In this paper, using the theory of intersection complexes, we classify the class of 2-braid groups over graphs with circumference ≤ 1 up to quasi-isometry. Moreover, we find a sufficient condition when such a graph 2-braid group is quasi-isometric to a right-angled Artin group or not. Finally, by applying the same method, we also find that there is an algorithm to determine whether two 4-braid groups over trees are quasi-isometric or not.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.