2023
DOI: 10.48550/arxiv.2302.04346
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On the stabilization of the topological complexity of graph braid groups

Abstract: We establish the first nontrivial lower bound on the (higher) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually stabilizes at its maximal possible value, a direct analogue of a stability phenomenon in the ordered setting first conjectured by Farber. We estimate the stable range in terms of the number of trivalent vertices.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?