A combinatorial description of topological complexity for finite spaces

DOI10.2140/AGT.2018.18.779MaRDI QIDQ1743504zbMATH OpenOpenAlexWikidataFDO

Authors Kohei Tanaka

Publication date 13 April 2018

Published in Algebraic \& Geometric Topology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.06755

zbMATH Keywords

topological complexityorder complexfinite space

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Homotopy equivalences in algebraic topology (55P10) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30)

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.

Recommendations

• Discrete topological complexity
• Higher analogs of simplicial and combinatorial complexity
• Symmetric topological complexity for finite spaces and classifying spaces
• Topological Complexities of Finite Digital Images
• Higher dimensional simplicial complexity

Cites work

• Algebraic topology of finite topological spaces and applications
• Finite Topological Spaces
• On category, in the sense of Lusternik-Schnirelmann
• Singular homology groups and homotopy groups of finite topological spaces
• Strong homotopy types, nerves and collapses
• Topological complexity of motion planning

Cited in

(10)

• scientific article; zbMATH DE number 1860601 (Why is no real title available?)
• A combinatorial characterization of Hurewicz cofibrations between finite topological spaces
• Homotopic distance between maps
• Sectional category of maps related to finite spaces
• New combinatorial topology upper and lower bounds for renaming
• Higher analogs of simplicial and combinatorial complexity
• THE A-COMPLEXITY OF A SPACE
• Symmetric topological complexity for finite spaces and classifying spaces
• Simplicial approximation and refinement of monoidal topological complexity
• Simplicial and combinatorial versions of higher symmetric topological complexity

This page was built for publication: A combinatorial description of topological complexity for finite spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743504)