Higher analogs of simplicial and combinatorial complexity (Q2329338): Difference between revisions

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.