Topological complexity of Khalimsky circles
Combinatorics of partially ordered sets (06A07) Applications of general topology to computer science (e.g., digital topology, image processing) (54H30) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Homotopy equivalences in algebraic topology (55P10)
The author studies the topological complexity of \emph{Khalimsky circles} \(S^1_n\), which are finite \(T_0\) spaces consisting of \(2n\) points and known to be weakly homotopy equivalent to the topological circle \(S^1\). The work is motivated by recent developments on topological complexity for finite spaces and addresses two conjectures posed by \textit{K. Tanaka} [Algebr. Geom. Topol. 18, No. 2, 779--796 (2018; Zbl 1394.55005)] concerning the behavior of this invariant under barycentric subdivision and its relation to the Lusternik-Schnirelmann category.\N\NAfter reviewing basic facts on finite \(T_0\) spaces, their interpretation as posets, and their relation to simplicial complexes, the author establishes explicit values of the topological complexity \(\mathrm{tc}(S^1_n)\) for all \(n \ge 2\). The main result shows that \(\mathrm{tc}(S^1_n)=1\) for all \(n\ge 5\), while the exceptional cases \(n=2,3,4\) are treated separately. In particular, this provides a negative answer to Tanaka's conjecture on the stability of topological complexity under barycentric subdivision and a positive answer to the existence of finite spaces \(X\) satisfying \(\mathrm{tc}(X)<\mathrm{cat}(X\times X)\).\N\NA key technical ingredient is a detailed homotopy classification of maps between Khalimsky circles, expressed in terms of a combinatorial notion of degree. This classification allows the author to control section-categorical subsets of \(S^1_n\times S^1_n\) and to construct explicit open coverings realizing the claimed bounds. The arguments combine combinatorial topology, finite space techniques, and careful case analysis. An appendix provides complete proofs of the homotopy classification results used in the main sections.\N\NThe paper offers a clear and self-contained contribution to the study of topological complexity in finite and digital settings, illustrating concrete differences between classical topological invariants and their finite-space counterparts.
- A combinatorial description of topological complexity for finite spaces
- A model structure on the category of small categories for coverings
- Algebraic topology of finite topological spaces and applications
- Discrete topological complexity
- Finite Topological Spaces
- General combinatorial topology.
- Homotopic distance between maps
- scientific article; zbMATH DE number 937422 (Why is no real title available?)
- Simplicial complexity: piecewise linear motion planning in robotics
- Singular homology groups and homotopy groups of finite topological spaces
- Topological complexity of motion planning
This page was built for publication: Topological complexity of Khalimsky circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906318)
