2000 character limit reached
Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Published 1 Aug 2019 in math.AT and math.GT | (1908.00394v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.