Higher analogs of simplicial and combinatorial complexity
Farber introduced topological complexity \(\operatorname{TC}(X)\) of a topological space \(X\) as the Schwarz genus of a map \(p: X^I \to X\times X\), where \(p\) assigns end points to a path. Now it is a well-developed concept, having applications to robotics. Later \textit{J. González} [New York J. Math. 24, 279--292 (2018; Zbl 1394.55004)] introduced a simplicial version (based on simplicial sets) of topological complexity, and \textit{K. Tanaka} [Algebr. Geom. Topol. 18, No. 2, 779--796 (2018; Zbl 1394.55005)] introduced the so-called combinatorial complexity, by using combinatorics of finite spaces i.e. connected finite \(T_0\)-spaces. It turns out that the geometric realization of simplicial complexity coincides with the Farber topological complexity, and similarly for combinatorial complexity. The reviewer defined (generalized) higher topological complexity \(\operatorname{TC}_n(X)\) as the Schwarz genus of a map \(p: X^I \to X^n\), where \(p\) assigns \(n\) intermediate points to a path. Here Farber's \(\operatorname{TC}\) is equal to \(\operatorname{TC}_2\). Following these ideas, the present author introduces and develops higher analogs of simplicial complexity and combinatorial complexity. The main theorems A, B, and C are more or less clear generalizations of the corresponding theorems in the ``non-higher results of González and Tanaka.
- Higher dimensional simplicial complexity
- Simplicial approximation and refinement of monoidal topological complexity
- Higher Topological Complexity of Artin Type Groups
- Motion planning in connected sums of real projective spaces
- An upper bound for higher topological complexity and higher strongly equivariant complexity
- Discrete topological complexity
- Topological complexity of \(H\)-spaces
- A combinatorial description of topological complexity for finite spaces
- Motion planning algorithms for configuration spaces in the higher dimensional case
- Simplicial complexity: piecewise linear motion planning in robotics
- A combinatorial description of topological complexity for finite spaces
- Finite Topological Spaces
- Homotopy theory of finite and locally finite \(T_ 0\) spaces
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- Invitation to topological robotics
- On higher analogs of topological complexity
- Simplicial complexity: piecewise linear motion planning in robotics
- Singular homology groups and homotopy groups of finite topological spaces
- Strong homotopy types, nerves and collapses
- Topological complexity of motion planning
- A combinatorial description of topological complexity for finite spaces
- Higher dimensional simplicial complexity
- Two robots moving geodesically on a tree
- Higher homotopic distance
- On higher analogs of topological complexity
- Simplicial and combinatorial versions of higher symmetric topological complexity
- Estimating the higher symmetric topological complexity of spheres
- Higher Topological Complexity of Artin Type Groups
- The higher topological complexity in digital images
- ON SPACES OF TOPOLOGICAL COMPLEXITY TWO
- Combinatorics of past-similarity in higher dimensional transition systems
- Different types of topological complexity based on higher homotopic distance
- Higher topological complexity of a map
- Topological representations of simplicial complexes and their applications
- Higher analogues of discrete topological complexity
This page was built for publication: Higher analogs of simplicial and combinatorial complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329338)
