2024/06/25 by Yuki Minowa, Minowa, Yuki
Computer Science · #Digital Image Processing Techniques #Computational Geometry and Mesh Generation #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2406.17227
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of spherical fibrations over spheres. We explicitly compute a lower bound in terms of weak category and determine the parametrized topological complexity of some spherical fibrations.