A polytopal generalization of sperner's lemma

Journal of Combinatorial Theory. Series A

Volumn 100, Issue 1, 2002, Pages 1-26

  De Loera, Jesus A ^a   Peterson, Elisha ^b   Edward Su, Francis ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MAGDALEN COLLEGE   (United Kingdom)

^c HARVEY MUDD COLLEGE   (United States)

Author keywords

Path following; Polytopes; Simplicial algorithms; Sperner's lemma

Indexed keywords

EID: 0036798681     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2002.3274     Document Type: Article

References (24)

1. T. V. Alekseyevskaya, Combinatorial bases in systems of simplices and chambers, Discrete Math. 157 (1996), 15-37.
2. K. T. Atanassov, On Sperner's lemma, Studia Sci. Math. Hungar. 32 (1996), 71-74.
3. D. Barnette, A proof of the lower bound conjecture for convex polytopes, Pacific J. Math. 46 (1973), 349-354.
4. L. J Billera, I. M. Gel'fand, and B. Sturmfels, Duality and minors of secondary polyhedra, J. Combin. Theory Ser. B 57 (1993), 258-268.
5. A. Björner, J. Matousek, and G. Ziegler, "Topological Combinatorics," book manuscript, in preparation.
6. A. Below, U. Brehm, J. A. De Loera, and J. Richter-Gebert, Minimal simplicial dissections and triangulations of convex 3-polytopes, Discrete Comput. Geom. 24 (2000), 35-48.
7. J. A. De Loera, F. Santos, and F. Takeuchi, Extremal properties for dissections of convex 3-polytopes, SIAM J. Discrete Math. 14 (2001), 143-161.
8. D. I. A. Cohen, On the Sperner lemma, J. Combin. Theory 2 (1967), 585-587.
9. Reference deleted in proof.
10. R. M. Freund, Combinatorial analogs of Brouwer's fixed-point theorem on a Bounded polyhedron, J. Combin. Theory Ser. B 47 (1989), 192-219.
11. Reference deleted in proof.
12. B. Knaster, C. Kuratowski, and S. Mazurkiewicz, Ein Beweis des Fixpunktsatzes für n-dimensionale Simplexe, Fund. Math. 14 (1929), 132-137.
13. H. W. Kuhn, Simplicial approximation of fixed points, Proc. Natl. Acad. Sci. 61 (1968), 1238-1242.
14. G. van der Laan, D. Talman, and Z. Yang, Intersection theorems on polytopes, Math. Programming 84 (1999), 25-38.
15. E. Peterson, "Combinatorial Proofs of Generalizations of Sperner's Lemma," Senior thesis, Harvey Mudd College, 2000.
16. B. L. Rothschild and E. G. Straus, On triangulations of the convex hull of n points, Combinatorica 5 (1985), 167-179.
17. H. Scarf, The approximation of fixed points of a continuous mapping, SIAM J. Appl. Math. 15 (1967), 1328-1343.
18. F. W. Simmons and F. E. Su, Consensus-halving via theorems of Borsuk-Ulam and Tucker, preprint.
19. W. D. Smith, A lower bound for the simplexity of the n-cube via hyperbolic volumes, special issue: Combinatorics of polytopes, European J. Combin. 21 (2000), 131-137.
20. E. Sperner, Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes, Abh. Math. Sem. Univ. Hamburg 6 (1928), 265-272.
21. F. E. Su, Rental harmony: Sperner's lemma in fair division, Amer. Math. Monthly 106 (1999), 930-942.
22. M. J. Todd, "The Computation of Fixed Points and Applications," Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, New York, 1976.
23. Z. Yang, "Computing Equilibria and Fixed Points," Kluwer Academic Publishers, Boston, 1999.
24. G. M. Ziegler, "Lectures on Polytopes," Springer-Verlag, New York, 1995.