A combinatorial description of topological complexity for finite spaces
Abstract
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the topological complexity of its order complex.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.