Some notes and comparisons on topological complexities
The paper addresses two main topics in the theory of topological complexity (\(TC\)), a numerical invariant related to the robot motion planning problem. The first part of the paper introduces and studies discrete analogues of \(TC\)-related invariants in the setting of simplicial complexes, while the second part establishes a relationship between the parametrized and targeted versions of higher topological complexity in the context of standard topological spaces.\N\NIn the first part, the author extends the work on discrete topological complexity by defining new concepts for simplicial complexes.\N\begin{itemize}\N\item [(i)] A notion of relative higher contiguity distance is introduced for simplicial maps defined on a subcomplex \(M \subseteq K\). This is then used to define the relative discrete higher topological complexity of a pair of simplicial complexes \((K, M)\), denoted by \(TC_n(K,M)\).\N\item [(ii)] The author defines the discrete parametrized higher topological complexity (\(DPTC_n\)), denoted \(TC_n[\phi: K \to L]\), for a simplicial fibration \(\phi: K \to L\).\N\item [(iii)] Several fundamental properties of these new invariants are established. For instance, it is shown that if the base complex \(L\) is strongly collapsible, then \(TC_n[\phi: K \to L]\) equals the discrete higher topological complexity of the fiber \(N\), i.e., \(TC_n(N)\). Furthermore, the \(DPTC_n\) is proven to be an invariant of strong fiber homotopy equivalence.\N\end{itemize}\N\NThe second part of the paper investigates the relationship between two generalizations of topological complexity for maps: the parametrized higher topological complexity (\(PTC_n\)) and the targeted higher topological complexity (\(TTC_n\)).\N\begin{itemize}\N\item [(i)] The main results provide inequalities between these two invariants under specific conditions on a given fibration \(f: X \to Y\) with a non-empty path-connected fiber \(A \subseteq X\). It is shown that \(TC_n[f: X \to Y] \leq TC_n(f,A)\) if \(f\) is an injective fibration. Conversely, \(TC_n[f: X \to Y] \geq TC_n(f,A)\) if \(f\) is a surjective fibration.\N\item [(ii)] A direct consequence of these results is that for a bijective fibration, the two notions coincide: \(TC_n[f: X \to Y] = TC_n(f,A)\).\N\item [(iii)] This equality allows for the transfer of known properties of \(PTC_n\) to \(TTC_n\) under the condition of a bijective fibration. The author lists several such corollaries, including homotopy invariance and an inequality for product maps.\N\end{itemize}
- Combinatorial algebraic topology
- Contiguity distance between simplicial maps
- Different types of topological complexity based on higher homotopic distance
- Digital topological complexity numbers
- Discrete topological complexity
- Formal aspects of parametrized topological complexity and its pointed version
- Higher analogues of discrete topological complexity
- Higher homotopic distance
- Homotopic distance between maps
- scientific article; zbMATH DE number 1973373 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- Invitation to topological robotics
- Lusternik-Schnirelmann category for simplicial complexes
- On higher analogs of topological complexity
- On the Lusternik-Schnirelmann category of a simplicial map
- On the targeted complexity of a map
- On the topological complexity of maps
- Parametrized topological complexity of collision-free motion planning in the plane
- Relative topological complexity of a pair
- Simplicial complexity: piecewise linear motion planning in robotics
- Simplicial fibrations
- Simplicial Lusternik-Schnirelmann category
- Strong homotopy types, nerves and collapses
- The higher topological complexity in digital images
- The number of nets of the regular convex polytopes in dimension \(\leq 4\)
- Topological complexity of a map
- Topological complexity of motion planning
- Topology of parametrized motion planning algorithms
This page was built for publication: Some notes and comparisons on topological complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928645)
