Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 12 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 110 tok/s Pro
GPT OSS 120B 470 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Higher topological complexity and its symmetrization (1009.1851v6)

Published 9 Sep 2010 in math.AT

Abstract: We develop the properties of the $n$-th sequential topological complexity $TC_n$, a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in robotics. We exhibit close connections of $TC_n(X)$ to the Lusternik-Schnirelmann category of cartesian powers of $X$, to the cup-length of the diagonal embedding $X\hookrightarrow Xn$, and to the ratio between homotopy dimension and connectivity of $X$. We fully compute the numerical value of $TC_n$ for products of spheres, closed 1-connected symplectic manifolds, and quaternionic projective spaces. Our study includes two symmetrized versions of $TC_n(X)$. The first one, unlike Farber-Grant's symmetric topological complexity, turns out to be a homotopy invariant of $X$; the second one is closely tied to the homotopical properties of the configuration space of cardinality-$n$ subsets of $X$. Special attention is given to the case of spheres.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.