Higher topological complexity of a map

Abstract

The higher topological complexity of a space X, TCr(X), r=2,3,…, and the topological complexity of a map f, TC(f), have been introduced by Rudyak and Pavesi\'c, respectively, as natural extensions of Farber's topological complexity of a space. In this paper we introduce a notion of higher topological complexity of a map~f, TCr,s(f), for 1≤ s≤ r≥2, which simultaneously extends Rudyak's and Pavesi\'c's notions. Our unified concept is relevant in the r-multitasking motion planning problem associated to a robot devise when the forward kinematics map plays a role in s prescribed stages of the motion task. We study the homotopy invariance and the behavior of TCr,s under products and compositions of maps, as well as the dependence of TCr,s on r and s. We draw general estimates for TCr,s(f X Y) in terms of categorical invariants associated to X, Y and f. In particular, we describe within one the value of TCr,s in the case of the non-trivial double covering over real projective spaces, as well as for their complex counterparts.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…