Beyond Sperner's lemma
From MaRDI portal
Publication:6313495
arXiv1902.00827MaRDI QIDQ6313495FDOQ6313495
Authors: Nikolai V. Ivanov 
Publication date: 2 February 2019
Abstract: In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatorial analogue of Sperner's lemma. Scarf presented his arguments in very geometric language, even purely combinatorial ones. Recently H. Petri and M. Voorneveld published an almost geometry-free version of Scarf's proof. Their version eliminated even only implicitly geometric aspects of Scarf's proof, namely, the structure of an abstract simplicial complex behind the combinatorial arguments. The present paper is devoted to a proof of Scarf's analogue of Sperner's lemma in the abstract setting of a collection of linear orders on a finite set. This proof partially follows the proof by Petri and Voorneveld, but restores the implicit geometry to its rightful place. We also deduce Brouwer's fixed point theorem from this analogue and discuss various versions of Scarf's proof.
Combinatorial aspects of simplicial complexes (05E45) Fixed points and coincidences in algebraic topology (55M20) Degree, winding number (55M25) Ordered sets (06A99)
This page was built for publication: Beyond Sperner's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6313495)
