Embedding right-angled Artin groups into graph braid groups
Abstract
We construct an embedding of any right-angled Artin group G() defined by a graph into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of . This construction yields an example of a hyperbolic surface subgroup embedded in a two strand planar graph braid group.
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.