Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
DOI10.1016/0095-8956(89)90020-8zbMATH Open0723.55001OpenAlexW1974855372MaRDI QIDQ756763FDOQ756763
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
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
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Fixed points and coincidences in algebraic topology (55M20) PL-topology (57Q99)
Cites Work
- Title not available (Why is that?)
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Title not available (Why is that?)
- The Approximation of Fixed Points of a Continuous Mapping
- On the basic theorem of complementarity
- Some Combinatorial Lemmas in Topology
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- A theorem about antiprisms
- A unified approach to complementarity in optimization
- Combinatorial properties of certain simplicial and cubical vertex maps
- Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
- Title not available (Why is that?)
- A Hybrid Algorithm for the Computation of Fixed Points
Cited In (13)
- Title not available (Why is that?)
- Combinatorial integer labeling theorems on finite sets with applications
- Combinatorial lemmas for polyhedrons I
- 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
- On the number of bounding cycles for nonlinear arrangements
- Existence of balanced simplices on polytopes.
- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Using volume to prove Sperner's Lemma
- Combinatorial lemma for Lebesgue-Brouwer partition of cube on Euclidean space
- A polytopal generalization of Sperner's lemma
- A combinatorial proof of a formula for Betti numbers of a stacked polytope
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)
