A combinatorial description of topological complexity for finite spaces

Published 22 May 2016 in math.CO and math.AT | (1605.06755v2)

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.