Existence of balanced simplices on polytopes.

DOI10.1006/JCTA.2001.3178zbMATH Open1091.52007OpenAlexW2120842026MaRDI QIDQ5953376FDOQ5953376

Authors: Gerard van der Laan, Dolf Talman, Zaifu Yang 

Publication date: 11 March 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/4240b1b6-949e-4d15-942e-8e4dc7fb3465

Recommendations

• Combinatorial lemmas for polyhedrons I
• A direct proof of Shapley-Sperner's lemma based on the KKMS lemma
• scientific article; zbMATH DE number 4066896
• Combinatorial Lemmas for Polyhedrons
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron

zbMATH Keywords

fixed pointssimplicial subdivisioninteger labelingcombinatorial theorems

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Cites Work

• Simplicial algorithms on the simplotope
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The computation of fixed points and applications
• Title not available (Why is that?)
• The Approximation of Fixed Points of a Continuous Mapping
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• On the Sperner lemma
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• Title not available (Why is that?)
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• Title not available (Why is that?)
• Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
• A Hybrid Algorithm for the Computation of Fixed Points
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
• A constructive proof of a permutation-based generalization of Sperner's lemma
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
• Topological degree and the Sperner lemma
• Title not available (Why is that?)

Cited In (13)

• Combinatorial integer labeling theorems on finite sets with applications
• Combinatorial lemmas for polyhedrons I
• Sperner labellings: A combinatorial approach
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Combinatorial Lemmas for Polyhedrons
• A combinatorial proof of a theorem of Freund
• Title not available (Why is that?)
• Combinatorial formulae for multiple set-valued labellings
• Balanced simplices
• Title not available (Why is that?)
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
• On equilibrium theorem
• A polytopal generalization of Sperner's lemma

This page was built for publication: Existence of balanced simplices on polytopes.

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