Symmetric topological complexity for finite spaces and classifying spaces (Q2178766)

Given a finite space \(P\), its order complex \(K(P)\) is the simplicial complex that consists of totally ordered subsets of \(P\). The geometric realization of \(K(P)\) is called the classifying space of \(P\) and is denoted by \(B(P)\). In the present paper, the author develops two combinatorial approaches to the symmetric motion planning problem in the context of finite spaces. He presents two types of invariants, \(\text{CC}^S_k(P)\) and \(\text{CC}^{\Sigma}_k(P)\), for a finite space \(P\) by using the \(k\)-iterated barycentric subdivision of the product \(P\times P\). Furthermore, he shows the following statements. \textbf{Theorem 3.15.} For any finite space \(P\), it holds that \(\text{CC}^{\Sigma}_k(P)=\text{TC}^{\Sigma}(B(P))\) for sufficiently large \(k\). Here \(\text{TC}^{\Sigma}\) is the symmetrized topological complexity which was introduced by \textit{I. Basabe} et al. [Algebr. Geom. Topol. 14, No. 4, 2103--2124 (2014; Zbl 1348.55005)]. \textbf{Theorem 4.9.} For any finite space \(P\), it holds that \(\text{CC}^{S}_k(P)=\text{TC}^{S}(B(P))\) for sufficiently large \(k\). Here \(\text{TC}^{S}\) is the symmetric topological complexity which was introduced by \textit{M. Farber} and \textit{M. Grant} [Contemp. Math. 438, 85--104 (2007; Zbl 1143.70013)].