Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.