Sperner type lemma for quadrangulations

MaRDI QIDQ268063zbMATH OpenFDO

Authors Oleg R. Musin

Publication date 13 April 2016

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

degree of mappingquadrangulationSperner's lemma

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Degree, winding number (55M25)

Abstract: Sperner's lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We present a generalization of this lemma, where instead of triangulations are considered quadrangulations.

Review text

Let \(S\) be a \(d\)-dimensional simplex with vertices \(v_1, \dots, v_{d+1}\). Let \(T\) be a triangulation of \(S\). Suppose that to each vertex of \(T\) a unique label from the set \(\{1, 2, \dots, d+1\}\) is assigned. A labelling \(L\) is called Sperner if the vertices are labelled in such a way that a vertex of \(T\) belonging to the interior of a face \(F\) of \(S\) can only be labelled by \(k\) if \(v_k\) is on \(S\). Sperner's Lemma is a discrete analog of the Brouwer fixed point theorem and states that every Sperner labelling of a triangulation of a \(d\)-dimensional simplex contains a cell labelled with a complete set of labels: \(\{1, 2, \dots, d+1\}\).NEWLINENEWLINEIn the paper under review, the author presents a generalization of this lemma by considering the quadrangulations instead of triangulations.

Recommendations

• A polytopal generalization of Sperner's lemma
• Sperner labellings: A combinatorial approach
• An aspect of Sperner's lemma as a fixed point theorem
• Sperner's colorings and optimal partitioning of the simplex
• Classroom Notes

Cited in

(7)

• Proving Tucker's lemma with a volume argument
• scientific article; zbMATH DE number 5178933 (Why is no real title available?)
• Schwarz lemma for the tetrablock
• Towards a proof of the 24-cell conjecture
• Lower bounds on tree covers
• Sperner labellings: A combinatorial approach
• Quadripartite version of the Hajnal-Szemerédi theorem

This page was built for publication: Sperner type lemma for quadrangulations

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