Cubes and cubical chains and cochains in combinatorial topology
Nikolai V. Ivanov

TL;DR
This paper develops a new combinatorial cubical approach to classical topological theorems, simplifying proofs and clarifying the relationships between lemmas like Sperner's and Lebesgue's invariance of dimension.
Contribution
It introduces a novel combinatorial framework using cubical chains and cochains, providing elementary proofs and new lemmas in combinatorial topology.
Findings
New cubical lemmas for combinatorial topology
Clarification of cubical versions of Sperner's lemma
A conceptual, elementary approach to Lebesgue and Lusternik-Schnirelmann theorems
Abstract
The present paper is a continuation of author's paper arXiv:1909.00940 [math.AT] devoted to the lemmas of Alexander and Sperner, but is independent from it. We begin by a step back from Alexander and Sperner to Lebesgue work on the invariance of the dimension. In contrast with almost everybody else, Lebesgue worked with cubes rather than with simplices. His methods were developed by Hurewicz and Lusternik-Schnirelmann and then forgotten. In the present paper these methods are recast in the language of cubical chains and cochains. After this, we present a new approach to Lebesgue and Lusternik-Schnirelmann theorems which is both conceptual and elementary. It is based on adaptation of Serre's definition of products of singular cubical cochains to discrete setting. The main results are new purely combinatorial "cubical lemmas". This approach also clarifies the cubical versions of Sperner…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation · Mathematics and Applications
