Proving Tucker's lemma with a volume argument

DOI10.1090/CONM/685/13753MaRDI QIDQ2979657zbMATH OpenOpenAlexFDO

Authors Beauttie Kuture, Oscar Leong, Christopher Loa, Mutiara Sondjaja, Francis Edward Su

Publication date 25 April 2017

Published in Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Sperner's lemma

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorial geometries and geometric closure systems (51D20) Fixed points and coincidences in algebraic topology (55M20)

Abstract: Sperner's lemma is a statement about labeled triangulations of a simplex. McLennan and Tourky (2007) provided a novel proof of Sperner's Lemma by examining volumes of simplices in a triangulation under time-linear simplex-linear deformation. We adapt a similar argument to prove Tucker's Lemma on a triangulated cross-polytope $P$. The McLennan-Tourky technique does not directly apply because this deformation may distort the volume of $P$. We remedy this by inscribing $P$ in its dual polytope, triangulating it, and considering how the volumes of deformed simplices behave.

Recommendations

• A Borsuk-Ulam equivalent that directly implies Sperner's lemma
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• Sperner type lemma for quadrangulations
• A geometric approach to combinatorial fixed-point theorems: extended abstract
• A proof of the Sperner lemma from the Brouwer fixed point theorem

Cites work

• scientific article; zbMATH DE number 3063670 (Why is no real title available?)
• scientific article; zbMATH DE number 3102257 (Why is no real title available?)
• A combinatorial proof of Tucker's lemma for the n-cube
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• A constructive proof of Tucker's combinatorial lemma
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Discrete splittings of the necklace
• Non-cooperative games
• Rental Harmony: Sperner's Lemma in Fair Division
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Using volume to prove Sperner's Lemma

This page was built for publication: Proving Tucker's lemma with a volume argument

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