A combinatorial description of topological complexity for finite spaces
Combinatorics
2019-03-22 v2 Algebraic Topology
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.
Cite
@article{arxiv.1605.06755,
title = {A combinatorial description of topological complexity for finite spaces},
author = {Kohei Tanaka},
journal= {arXiv preprint arXiv:1605.06755},
year = {2019}
}
Comments
This is the final version