Equality of sectional category and higher topological complexity for real projective spaces

About 10 years old · traced to

Let Gs=(Z2)×(s−1)G_s=(\mathbb{Z}_2)^{\times(s-1)}, let πs\pi_s be the projective product covering considered above, and let ϕs ⁣:(Sm)×s→Jsecat⁡(πs)(Gs)\phi_s\colon(S^m)^{\times s}\to J_{\operatorname{secat}(\pi_s)}(G_s) be a GsG_s-equivariant map satisfying

ϕs(x1,…,xs−1,−xs)=σ1⋯σs−1⋅ϕs(x1,…,xs−1,xs).\phi_s(x_1,\ldots,x_{s-1},-x_s)=\sigma_1\cdots\sigma_{s-1}\cdot\phi_s(x_1,\ldots,x_{s-1},x_s).

Equality conjecture. An ss-motion planning algorithm for RP⁡m\operatorname{\mathbb{R}P}^m with secat⁡(πs)+1\operatorname{secat}(\pi_s)+1 ss-local rules can be constructed out of such a map. Consequently,

secat⁡(πs)≥TC⁡s(RP⁡m),\operatorname{secat}(\pi_s)\geq\operatorname{TC}_s(\operatorname{\mathbb{R}P}^m),

and the previously established expression for secat⁡(πs)\operatorname{secat}(\pi_s) becomes an equality for every s≥2s\geq2. This identifies the sectional category of the projective product covering with higher topological complexity and would provide motion-planning algorithms with the asserted number of local rules.

References

Primary source

Jesus Gonzalez, Darwin Gutierrez and Adriana Lara, “Projective product coverings and sequential motion planning algorithms in real projective spaces”, arXiv:1605.07966 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.