Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
From MaRDI portal
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.
This page was built for publication: Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323028)
