Results from combinatorial topology have shown that certain combinatorial lemmas are equivalent to certain topologocal fixed point theorems. For example, Sperner’s lemma about labelings of triangulated simplices is equivalent to the fixed point theorem of Brouwer. Moreover, since Sperner’s lemma has a constructive proof, its equivalence to the Brouwer fixed point theorem provides a constructive method for actually finding the fixed points rather than just stating their existence. The goal of this research project is to develop a combinatorial analogue for the Poincare ́-Birkhoff fixed point theorem.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1148 |
| Date | 01 May 2003 |
| Creators | Cloutier, John |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | HMC Senior Theses |
Page generated in 0.0017 seconds