Bounds for the higher topological complexity of configuration spaces of trees

From MaRDI portal
Publication:6156416

DOI10.1016/J.TOPOL.2023.108608zbMATH Open1526.55003arXiv2206.04201OpenAlexW4378675269WikidataQ123008855 ScholiaQ123008855MaRDI QIDQ6156416FDOQ6156416


Authors: Teresa I. Hoekstra-Mendoza Edit this on Wikidata


Publication date: 13 June 2023

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

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


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




Recommendations




Cites Work


Cited In (4)





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)