The topological complexity of pure graph braid groups is stably maximal
Algebraic Topology
2022-09-20 v2 Geometric Topology
Abstract
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our arguments apply equally to higher topological complexity.
Cite
@article{arxiv.2206.06268,
title = {The topological complexity of pure graph braid groups is stably maximal},
author = {Ben Knudsen},
journal= {arXiv preprint arXiv:2206.06268},
year = {2022}
}
Comments
9 pages. Minor changes. To appear in Forum of Mathematics, Sigma. May differ slightly from published version