arXiv · 1908.00394
Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Abstract
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the description of a hidden symmetry among the parameters, and known results from the literature to explicitly compute the exact degree to which these complexes and groups are connected at infinity.
Explore related subjects
Keep this discovery
Kristen Mazur, Jon McCammond, John Meier, Ranjan Rohatgi. 2019-08-01. Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph. https://arxiv.org/abs/1908.00394
Cite the original work for its findings. Save a collection to share your selection of sources.