Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Algebraic Topology
2019-08-02 v1 Geometric Topology
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.
Cite
@article{arxiv.1908.00394,
title = {Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph},
author = {Kristen Mazur and Jon McCammond and John Meier and Ranjan Rohatgi},
journal= {arXiv preprint arXiv:1908.00394},
year = {2019}
}