Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
From MaRDI portal
Publication:412368
DOI10.1016/j.dam.2011.11.018zbMath1401.52026OpenAlexW2159809789WikidataQ124906580 ScholiaQ124906580MaRDI QIDQ412368
Kazuo Murota, Akihisa Tamura, Takuya Iimura
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.018
Cites Work
- Simplicial algorithms on the simplotope
- Discrete fixed point analysis and its applications
- Discrete fixed point theorem reconsidered
- A Simplicial Approach for Discrete Fixed Point Theorems
- Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
This page was built for publication: Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope