English

Higher Analogues of Discrete Topological Complexity

Algebraic Topology 2024-04-17 v2

Abstract

In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with each other. Moreover, we find a lower bound of nn-discrete topological complexity which is given by the n-th usual topological complexity of the geometric realisation of that complex. Furthermore, we give an example for the strict case of that lower bound.

Keywords

Cite

@article{arxiv.2310.01333,
  title  = {Higher Analogues of Discrete Topological Complexity},
  author = {Hilal Alabay and Ayse Borat and Esra Cihangirli and Esma Dirican Erdal},
  journal= {arXiv preprint arXiv:2310.01333},
  year   = {2024}
}