Embedding right-angled Artin groups into graph braid groups.

From MaRDI portal
Publication:2642672



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


\textit{J. Crisp} and \textit{B. Wiest}, [in Algebr. Geom. Topol. 4, 439-472 (2004; Zbl 1057.20028)], showed that for any finite graph \(\Gamma\) and any \(n\), there exists a graph \(\Delta\) such that \(B_n\Gamma\), the (\(n\)-strand) graph braid group, embeds in \(G(\Delta)\), the right-angled Artin group associated to \(\Delta\). In this paper, the opposite direction is proven: For every finite graph \(\Delta\) and any coloring \(C\) of \(\Delta\) with \(n\) colors, there exists a graph \(\Gamma\) such that the right-angled Artin group \(G(\Delta)\) embeds into the graph braid group \(B_n\Gamma\). The construction yields an example of a hyperbolic surface subgroup embedded in a two strand planar graph braid group.











This page was built for publication: Embedding right-angled Artin groups into graph braid groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642672)