Skip to content
DraconiticResearch
Search Sources API
194,164 studies31 sourcesUpdated 45 min ago
PreprintarXiv licencearXiv

Monoidal and symmetrized parametrized topological complexity

Abstract

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án--González (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.

Related

  1. Equivariant persistence topological complexity
    Navnath Daundkar, Ankur Sarkar, Bittu Singh
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  2. Increase in topological complexity along the mean curvature flow
    Natasha Diederen
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsGeometry & topologyarXiv
  3. Motion planning and topological complexity for diagrams of spaces
    Isaac Carcacía-Campos
    arXivPreprintarXiv licenceFull textAlgebra & number theoryGeometry & topologyarXiv
  4. Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions
    Jintao Luo
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsLogic & foundationsarXiv
  5. A topological version of the Cartan-Hadamard Theorem and asphericity complexity
    Elias Gabriel Minian, Juan Martín Perez Garber
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{arora2026monoidal,
  title = {{Monoidal and symmetrized parametrized topological complexity}},
  author = {Ramandeep Singh Arora and Navnath Daundkar},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2608.08737},
  eprint = {2608.08737},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.08737},
}
RIS
TY  - UNPB
TI  - Monoidal and symmetrized parametrized topological complexity
AU  - Ramandeep Singh Arora
AU  - Navnath Daundkar
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2608.08737
UR  - https://arxiv.org/abs/2608.08737
AB  - 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án--González (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.
ER  -