Relative topological complexity of a pair
Abstract
For a pair of spaces X and Y such that Y ⊂eq X, we define the relative topological complexity of the pair (X,Y) as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number of motion planning rules needed for a continuous motion planner from X to Y. We give basic estimates on the invariant, and we connect it to both Lusternik-Schnirelmann category and topological complexity. In the process, we compute this invariant for several example spaces including wedges of spheres, topological groups, and spatial polygon spaces. In addition, we connect the invariant to the existence of certain types of axial maps.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.