The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip
Bulletin of the London Mathematical Society · 2026-07 · 58 (7)
DOI: 10.1112/blms.70421 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 13.07.2026. Verfasst von Nicholas Wawrykow. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
How hard is it to program robots to move about a long narrow aisle while making a series of intermediate stops, provided only of the robots can fit across the width of the aisle? In this paper, we answer this question by calculating the ‐sequential topological complexity of , the ordered configuration space of open unit‐diameter disks in the infinite strip of width , as well as its ‐sequential distributional topological complexity. We prove that, as long as is greater than , the ‐sequential (distributional) topological complexity of is . This shows that any nonlooping program moving the robots between arbitrary initial and final configurations, with intermediate stops, must consider at least cases.
Zitieren
APA
Wawrykow, N. (2026). The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip. Bulletin of the London Mathematical Society, 58(7). https://doi.org/10.1112/blms.70421
Vancouver
Wawrykow N. The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip. Bulletin of the London Mathematical Society. 2026;58(7). doi:10.1112/blms.70421
BibTeX
@article{Wawrykow2026,
author = {Wawrykow, Nicholas},
title = {The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip},
journal = {Bulletin of the London Mathematical Society},
year = {2026},
volume = {58},
number = {7},
doi = {10.1112/blms.70421}
}
EUVIMED