Monoidal and symmetrized parametrized topological complexity

We introduce and study monoidal and symmetrized versions of parametrized topological complexity. First, we develop parametrized analogues of the monoidal topological complexity theories of Iwase–Sakai, Aguilar-Guzm'an–Gonz'alez (based on the Fadell–Husseini approach), and Dranishnikov. We investigate the parametrized Iwase–Sakai conjecture and provide sufficient conditions under which it holds. We then introduce symmetrized parametrized topological complexity and combine it with the monoidal perspective to define monoidal symmetrized parametrized topological complexity, showing that the resulting notions agree. Finally, we compute these invariants for Fadell–Neuwirth fibrations.