Bounds for higher topological complexity of real projective space implied by BP (Q2010852)

This work can be considered as an instance of Topological Robotics. The main tool emanating from this work is the higher topological complexity TC\(_s(X)\) (\(s\geq 2\)) introduced by \textit{Y. B. Rudyak} [Topology Appl. 157, No. 5, 916--920 (2010; Zbl 1187.55001)]. Generally, the determination of TC\(_s(P^{n})\) is very difficult, where \(P^n\) is the \(n\)-dimensional real projective space. It can be estimated from above by homotopical methods, and from below by cohomological methods. The goal of this article is to use Brown-Peterson cohomology to obtain lower bounds for TC\(_s(P^{2m})\) for \(s\geq 3\) which are often much stronger than those implied by ordinary mod-2 cohomology. Lower bounds implied by ordinary mod-2 cohomology have been presented by the author in [J. Pure Appl. Algebra 222, No. 10, 2881--2887 (2018; Zbl 1393.55003)].