Arrangements associated to chordal graphs and limits of colored braid groups
Abstract
Let G be a chordal graph, X(G) the complement of the associated complex arrangement and Gamma(G) the fundamental group of X(G). We show that Gamma(G) is a limit of colored braid groups over the poset of simplices of G. When G = GT is the comparability graph associated with a rooted tree T, a case recently investigated by the first author, the result takes the following very simple form: Gamma(GT) is a limit over T of colored braid groups.
0
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.