Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron

DOI10.1016/0095-8956(89)90020-8MaRDI QIDQ756763zbMATHOpenAlexFDO

Authors Robert M. Freund

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0095-8956(89)90020-8

zbMATH Keywords

Sperner lemmafixed-point theorempseudomanifoldbounded polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Fixed points and coincidences in algebraic topology (55M20) PL-topology (57Q99)

Recommendations

• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Existence of balanced simplices on polytopes.
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
• An aspect of Sperner's lemma as a fixed point theorem
• A polytopal generalization of Sperner's lemma

Cites work

• scientific article; zbMATH DE number 3831632 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• 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 Hybrid Algorithm for the Computation of Fixed Points
• A theorem about antiprisms
• A unified approach to complementarity in optimization
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Combinatorial properties of certain simplicial and cubical vertex maps
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• On the basic theorem of complementarity
• 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
• Some Combinatorial Lemmas in Topology
• The Approximation of Fixed Points of a Continuous Mapping
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods

Cited in

(14)

• Combinatorial lemmas for polyhedrons I
• On the number of bounding cycles for nonlinear arrangements
• Combinatorial lemma for Lebesgue-Brouwer partition of cube on Euclidean space
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• A combinatorial proof of a formula for Betti numbers of a stacked polytope
• Existence of balanced simplices on polytopes.
• A combinatorial proof of a theorem of Freund
• A geometric approach to combinatorial fixed-point theorems: extended abstract
• Projective re-normalization for improving the behavior of a homogeneous conic linear system
• scientific article; zbMATH DE number 4141821 (Why is no real title available?)
• Combinatorial integer labeling theorems on finite sets with applications
• A polytopal generalization of Sperner's lemma
• Using volume to prove Sperner's Lemma
• Combinatorial Lemmas for Polyhedrons

This page was built for publication: Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron

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