Papers
Topics
Authors
Recent
Search
2000 character limit reached

Equivariant parametrized topological complexity

Published 31 May 2024 in math.AT | (2405.20809v3)

Abstract: In this paper, we define and study an equivariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity. We show that several results in the non-equivariant case can be extended to the equivariant case. For example, we establish the fibrewise equivariant homotopy invariance of the sequential equivariant parametrized topological complexity. We obtain several bounds on sequential equivariant topological complexity involving equivariant category. We also obtain the cohomological lower bound and the dimension-connectivity upper bound on the sequential equivariant parametrized topological complexity. In the end we use these results to compute sequential equivariant parametrized topological complexity of equivariant Fadell-Neuwirth fibrations and some equivariant fibrations involving generalized projective product spaces.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.