Combinatorial Proofs of Generalizations of Sperner's Lemma
In this thesis, we provide constructive proofs of serveral generalizations of Sperner's Lemma, a combinatorial result which is equivalent to the Brouwer Fixed Point Theorem. This lemma makes a statement about the number of a certain type of simplices in the triangulation of a simplex with a spe...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2000
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/124 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1127&context=hmc_theses |