Motion planning in polyhedral products of groups and a Fadell-Husseini approach to topological complexity

TL;DR

This paper computes the topological complexity of polyhedral products of groups using a combinatorial formula and confirms the Iwase-Sakai conjecture for these spaces, employing a Fadell-Husseini approach to topological complexity.

Contribution

It introduces a Fadell-Husseini viewpoint for monoidal topological complexity and provides a combinatorial formula for the topological complexity of polyhedral products of groups.

Findings

Topological complexity of polyhedral products is given by a combinatorial formula.

The Iwase-Sakai conjecture holds for these polyhedral products.

A Fadell-Husseini perspective effectively encodes the monoidal topological complexity.

Abstract

We compute the topological complexity of a polyhedral product $\mathcal{Z}$ defined in terms of an LS-logarithmic family of locally compact connected CW topological groups. The answer is given by a combinatorial formula that involves the LS category of the polyhedral-product factors. As a by-product, we show that the Iwase-Sakai conjecture holds true for $\mathcal{Z}$. The proof methodology uses a Fadell-Husseini viewpoint for the monoidal topological complexity (MTC) of a space, which, under mild conditions, recovers Iwase-Sakai's original definition. In the Fadell-Husseini context, the stasis condition -- MTC's raison d'\^etre -- can be encoded at the covering level. Our Fadell-Husseini-inspired definition provides an alternative to the MTC variant given by Dranishnikov, as well as to the ones provided by Garc\'ia-Calcines, Carrasquel-Vera and Vandembroucq in terms of relative category.