Bounds for the higher topological complexity of configuration spaces of trees

DOI10.1016/J.TOPOL.2023.108608MaRDI QIDQ6156416zbMATH OpenOpenAlexWikidataFDO

Authors Teresa I. Hoekstra-Mendoza

Publication date 13 June 2023

Published in Topology and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

configuration spaces of treeshigher topological complexity

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)

Abstract: For a tree $T$, we show that for many positive integer values of $n$, and an integer $sgeq2$, the higher topological complexity $T{C}_s$ of the unordered configuration spaces of trees $Umathcal{C}^{n}T$, is maximal. In other words, we prove that, $T{C}_s(Umathcal{C}^{n}T)=s(hdim(Umathcal{C}^{n}T))$ where $hdim$ stands for the homotopy dimension.

Review text

For any integer \(s\), the \(s\)th topological complexity \(\mathrm{TC}_s(X)\) of a space \(X\) can be described as the minimal integer \(n\) for which there exists a cover of \(X^s\) by \(n+1\) open subsets \(U_0, \dots, U_n\) such that the diagonal \(\Delta\colon X \to X^s\colon x \mapsto (x,\dots,x)\) admits a local homotopy section over each \(U_i\). This notion, due to Rudyak, extends Farber's notion of topological complexity \(\mathrm{TC}\); indeed \(\mathrm{TC}(X) = \mathrm{TC}_2(X)\). There is a theorem of \textit{S. Scheirer} [Algebr. Geom. Topol. 18, No. 2, 839--876 (2018; Zbl 1393.55004)] which gives bounds for the usual (\(s=2\)) topological complexity of the configuration spaces of trees. Using slightly different methods, T.I. Hoekstra-Mendoza in the present paper generalizes Scheirer's results for any \(s \ge 2\). For a finite tree \(T\) and a positive integer \(n\), let \(\mathcal{C}^nT\) denote the configuration space of \(n\) ordered points on \(T\). Abrams' discrete model for \(\mathcal{C}^nT\) is the largest cubical subset \(\mathcal{D}^nT\) of \(T^n\) inside \(\mathcal{C}^nT\). As usual, the symmetric group \(\Sigma_n\) acts on the right of \(\mathcal{D}^nT\) by permuting factors. The quotient complex is denoted by \(U \mathcal{D}^nT\). The author proves that the higher topological complexity of \(U \mathcal{D}^nT\) is maximal for any tree \(T\) and many values of \(n\). One of the main results is that if \(n \ge 2 m + h_s(T)\), then \(\mathrm{TC}_s(U \mathcal{D}^n T) \ge sm\), and this inequality is sharp, where \(h_s(T)\) denotes the minimal integer such that there exist \(s\) sets of vertices satisfying some specific properties.

Recommendations

• Farley-Sabalka's Morse-theory model and the higher topological complexity of ordered configuration spaces on trees
• Topological complexity of \(n\) points on a tree
• Topological complexity of unordered configuration spaces of certain graphs
• The topological complexity of pure graph braid groups is stably maximal
• The higher topological complexity of configuration spaces of odd-dimensional spheres

Cites work

• Cohomology ring of tree braid groups and exterior face rings
• Discrete Morse theory and graph braid groups.
• Higher topological complexity and its symmetrization
• Homology of tree braid groups.

Cited in

(6)

• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• On compact trees with the coarse wedge topology
• The topological trees with extreme Matula numbers
• Farber's conjecture and beyond
• On the stabilization of the topological complexity of graph braid groups
• The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip

This page was built for publication: Bounds for the higher topological complexity of configuration spaces of trees

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