A polytopal generalization of Sperner's lemma
From MaRDI portal
Publication:1865380
DOI10.1006/jcta.2002.3274zbMath1015.05089WikidataQ56286471 ScholiaQ56286471MaRDI QIDQ1865380
Francis Edward Su, Jesús A. De Loera, Elisha Peterson
Publication date: 26 March 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1680&context=hmc_fac_pub
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
05D05: Extremal set theory
Related Items
Sperner labellings: A combinatorial approach, Using volume to prove Sperner's Lemma, Two-player envy-free multi-cake division, Pebble sets in convex polygons, Alternate Heegaard genus bounds distance, A constructive proof of Ky Fan's generalization of Tucker's lemma
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
- Duality and minors of secondary polyhedra
- On triangulations of the convex hull of n points
- Extensions of Lemke's algorithm for the linear complementarity problem
- Intersection theorems on polytopes.
- Minimal simplicial dissections and triangulations of convex 3-polytopes
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Combinatorial bases in systems of simplices and chambers
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
- A proof of the lower bound conjecture for convex polytopes
- Extremal Properties for Dissections of Convex 3-Polytopes
- Rental Harmony: Sperner's Lemma in Fair Division
- Lectures on Polytopes
- The Approximation of Fixed Points of a Continuous Mapping
- On the Sperner lemma
- SIMPLICIAL APPROXIMATION OF FIXED POINTS