2000 character limit reached
An upper bound for higher topological complexity and higher strongly equivariant complexity (1912.05141v2)
Published 11 Dec 2019 in math.AT
Abstract: We prove an upper bound of higher topological complexity $TC_n(X)$ using higher $\mathcal{D}$-topological complexity $TC_n{\mathcal{D}}(X)$ of a space $X$. An intermediate invariant $\widetilde{TC}_n(X)$ is used in the proof. We interpret this invariant $\widetilde{TC}_n(X)$ as higher analogue of strongly equivariant topological complexity of the universal cover of $\widetilde{X}$ with the action of the fundamental group of $X$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.