For r robots on a complete bipartite graph K_{n,N}, the universal cover of the configuration space is (ℓ-2)-connected at infinity but not (ℓ-1)-connected at infinity, where ℓ is an explicit function of the four parameters.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
For r robots on a complete bipartite graph K_{n,N}, the universal cover of the configuration space is (ℓ-2)-connected at infinity but not (ℓ-1)-connected at infinity, where ℓ is an explicit function of the four parameters.