ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA
DOI10.15807/jorsj.31.19zbMath0655.90071WikidataQ124851318 ScholiaQ124851318MaRDI QIDQ3802897
Publication date: 1988
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.31.19
triangulation; convex polytope; Sperner's lemma; joins; fixed point algorithms; pseudomanifolds; lattice structures; combinatorial framework; labelling function \(\ell \)
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
54H25: Fixed-point and coincidence theorems (topological aspects)
58C30: Fixed-point theorems on manifolds
57Q15: Triangulating manifolds
57P99: Generalized manifolds
52Bxx: Polytopes and polyhedra
Related Items