The topological complexity of pure graph braid groups is stably maximal

DOI10.1017/FMS.2022.83MaRDI QIDQ5044387zbMATH OpenOpenAlexFDO

Authors Ben Knudsen

Publication date 31 October 2022

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2206.06268

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Discriminantal varieties and configuration spaces in algebraic topology (55R80) Topological methods in group theory (57M07)

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.

Recommendations

• Farber's conjecture for planar graphs
• Topological complexity of subgroups of Artin's braid groups
• Farley-Sabalka's Morse-theory model and the higher topological complexity of ordered configuration spaces on trees
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• Topological complexity of graphic arrangements

Cites work

• Deletion and contraction in configuration spaces of graphs
• Edge stabilization in the homology of graph braid groups
• Estimates for homological dimension of configuration spaces of graphs
• Farber's conjecture for planar graphs
• Farley-Sabalka's Morse-theory model and the higher topological complexity of ordered configuration spaces on trees
• Higher topological complexity and its symmetrization
• Higher topological complexity of aspherical spaces
• On higher analogs of topological complexity
• On the Lusternik-Schnirelmann category of abstract groups
• The homology of configuration spaces of trees with loops
• Topological complexity of motion planning

Cited in

(7)

• Connectivity at infinity for braid groups on complete graphs.
• Bounds for the higher topological complexity of configuration spaces of trees
• Analog category and complexity
• Farber's conjecture and beyond
• An algorithmic discrete gradient field and the cohomology algebra of configuration spaces of two points on complete graphs
• The topological complexity of the ordered configuration space of disks in a strip
• Products of free groups inside graph braid groups

This page was built for publication: The topological complexity of pure graph braid groups is stably maximal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044387)