Motion planning and topological complexity for diagrams of spaces

Abstract

A diagram of spaces describes a system of interacting state spaces. Motion planning in such a system is not merely an objectwise problem since the selected paths must form a natural family. This leads to a notion of topological complexity for diagrams, defined as the sectional category of their endpoint evaluation map. The role of points in this setting is played by orbits, namely diagrams whose colimit is a point. Different choices of admissible orbit shapes give rise to different levels of categorical compression. We consider the families of representable, discrete and arbitrary topological orbits, and the corresponding orbit-relative Lusternik--Schnirelmann categories. Their relationship with sectional category provides upper bounds for the topological complexity of a diagram, while its values and suitable inverse limits provide lower bounds. For diagrams indexed by a finite discrete group, the construction recovers equivariant LS-category, equivariant sectional category and equivariant topological complexity.

Persistence diagrams of finite topological spaces
Akhilesh Badra, Hemant Kumar Singh
arXiv12 Oct 2026PreprintCC BY 4.0Full textGeometry & topologyarXiv
Algebraically and geometrically minimal DG-models of diagrams of spaces
Nikita Golub
arXiv28 Sep 2026PreprintarXiv licenceFull textGeometry & topologyarXiv
Quadratic Complexity of Voronoi Diagrams in ℝ³ for Lines in a Single Ruling of a Regulus
Eunku Park, Kangjin Han
arXiv3 Nov 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv
Motion planning invariants and families of subgroups
Ekansh Jauhari, Ben Knudsen
arXiv24 Sep 2026PreprintCC BY 4.0Full textAlgebra & number theory Geometry & topologyarXiv
Billiard Orbits in Young Diagrams: Medial Links, Bicycle Spaces, and Domino Tilings
David J. Hemmer
arXiv15 Sep 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{carcaciacampos2026motion,
  title = {{Motion planning and topological complexity for diagrams of spaces}},
  author = {Isaac Carcacía-Campos},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16223},
  eprint = {2609.16223},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16223},
}

RIS

TY  - UNPB
TI  - Motion planning and topological complexity for diagrams of spaces
AU  - Isaac Carcacía-Campos
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.16223
UR  - https://arxiv.org/abs/2609.16223
AB  - A diagram of spaces describes a system of interacting state spaces. Motion planning in such a system is not merely an objectwise problem since the selected paths must form a natural family. This leads to a notion of topological complexity for diagrams, defined as the sectional category of their endpoint evaluation map. The role of points in this setting is played by orbits, namely diagrams whose colimit is a point. Different choices of admissible orbit shapes give rise to different levels of categorical compression. We consider the families of representable, discrete and arbitrary topological orbits, and the corresponding orbit-relative Lusternik--Schnirelmann categories. Their relationship with sectional category provides upper bounds for the topological complexity of a diagram, while its values and suitable inverse limits provide lower bounds. For diagrams indexed by a finite discrete group, the construction recovers equivariant LS-category, equivariant sectional category and equivariant topological complexity.
ER  -

Abstract

Related

Cite