A combinatorial description of topological complexity for finite spaces
From MaRDI portal
Publication:1743504
DOI10.2140/agt.2018.18.779zbMath1394.55005arXiv1605.06755MaRDI QIDQ1743504
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
06A07: Combinatorics of partially ordered sets
55M30: Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects)
55P10: Homotopy equivalences in algebraic topology
Related Items
Homotopic distance between maps, Simplicial approximation and refinement of monoidal topological complexity, Symmetric topological complexity for finite spaces and classifying spaces, Higher analogs of simplicial and combinatorial complexity, Simplicial and combinatorial versions of higher symmetric topological complexity
Cites Work