Defines a new probabilistic lower-bound invariant for parametrized topological complexity and proves it matches classical behavior on Fadell-Neuwirth fibrations and sphere bundles but differs on real projective space bundles with SO structure groups.
Equivariant and invariant parametrized topological complexity
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
For a $G$-equivariant fibration $p \colon E\to B$, we introduce and study the invariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity, called the invariant parametrized topological complexity. This notion generalizes the invariant topological complexity introduced by Lubawski and Marzantowicz. When $G$ is a compact Lie group acting freely on $E$, we show that the invariant parametrized topological complexity of the $G$-fibration $p \colon E\to B$ coincides with the parametrized topological complexity of the induced fibration $\overline{p} \colon \overline{E} \to \overline{B}$ between the orbit spaces. Furthermore, we compute the invariant parametrized topological complexity of equivariant Fadell-Neuwirth fibrations, which measures the complexity of motion planning in the presence of obstacles with unknown positions, where the order of their placement is irrelevant. In addition, we study the equivariant sectional category and the equivariant parametrized topological complexity, which serve as essential tools for obtaining several results in this paper.
fields
math.AT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the complexity of parametrized motion planning algorithms
Defines a new probabilistic lower-bound invariant for parametrized topological complexity and proves it matches classical behavior on Fadell-Neuwirth fibrations and sphere bundles but differs on real projective space bundles with SO structure groups.