Simplicial convexity and its applications (Q1099411): Difference between revisions

The author studies ``simplicial convexities'' using them to reformulate, modify or generalize known results. One of his theorems (Theorem 3.5) is essentially a reformulation of a selection theorem of the reviewer [Can. J. Math. 11, 556-575 (1959; Zbl 0093.366)] and \textit{D. Curtis} [Can. J. Math. 37, 747-759 (1985; Zbl 0563.54008)], except that Theorem 3.5 assumes that one can take ``convex combinations'' of all (rather than only some) n-tuples in the space. The last section studies Knaster- Kuratowski-Mazurkiewicz maps, and shows that certain results related to such maps which were known for ordinary convexity in linear spaces (especially some theorems of K. Fan) remain valid for ``finitely local convexity''.