Bounds for the higher topological complexity of configuration spaces of trees

2022/06/09 by Hoekstra-Mendoza, Teresa
#Algebraic Topology (math.AT) #FOS: Mathematics

paper · doi:10.48550/arxiv.2206.04201

Abstract

For a tree T, we show that for many positive integer values of n, and an integer s ≥ 2, the higher topological complexity TC_s of the unordered configuration spaces of trees UCⁿT, is maximal. In other words, we prove that, TC_s(U CⁿT) = s(hdim (U CⁿT)) where hdim stands for the homotopy dimension.

Related

• Topological complexity of configuration spaces
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• Relative Topological Complexity and Configuration Spaces
• An upper bound on the topological complexity of discriminantal varieties
• Farley-Sabalka's Morse-theory model and the higher topological complexity of ordered configuration spaces on trees