Bounds for the higher topological complexity of configuration spaces of trees

From MaRDI portal
Publication:6156416




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.









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)