Existence of balanced simplices on polytopes.

DOI10.1006/JCTA.2001.3178MaRDI QIDQ5953376zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fixed pointssimplicial subdivisioninteger labelingcombinatorial theorems

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

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

Cites work

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

Cited in

(16)

• Combinatorial integer labeling theorems on finite sets with applications
• Combinatorial lemmas for polyhedrons I
• A combinatorial lemma and its applications
• A direct proof of Shapley-Sperner's lemma based on the KKMS lemma
• Sperner labellings: A combinatorial approach
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• A combinatorial proof of a theorem of Freund
• Combinatorial Lemmas for Polyhedrons
• scientific article; zbMATH DE number 4050534 (Why is no real title available?)
• Combinatorial formulae for multiple set-valued labellings
• Balanced simplices
• scientific article; zbMATH DE number 3841921 (Why is no real title available?)
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
• On equilibrium theorem
• Fractionally balanced hypergraphs and rainbow KKM theorems
• 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)