Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
From MaRDI portal
Publication:756763
DOI10.1016/0095-8956(89)90020-8zbMath0723.55001OpenAlexW1974855372MaRDI QIDQ756763
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
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Fixed points and coincidences in algebraic topology (55M20) PL-topology (57Q99)
Related Items
Using volume to prove Sperner's Lemma ⋮ A combinatorial proof of a theorem of Freund ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ Existence of balanced simplices on polytopes. ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ A polytopal generalization of Sperner's lemma
Cites Work
- 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
- Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
- 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 Game of Hex and the Brouwer Fixed-Point Theorem
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
- A Hybrid Algorithm for the Computation of Fixed Points
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- On the basic theorem of complementarity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
