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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.