|
Mathematics Colloquium
|
|
Date:
 |
Monday February 19, 2007
|
 |
| Time: |
4:00 p.m. |
| Location: |
S G Mudd
/ 405
|
|
| Event Description: |
A Game on the Sperner Triangle
Kyle Burke '03, Boston University
Abstract: The equivalence of the Brouwer Fixed-Point Theorem to Sperner's Lemma draws on similar facets of the same property of the Hex Theorem. Using this as inspiration, many simple games reminiscent of Hex can be played on a Sperner Triangle. In this talk, I will show a proof of Sperner's Lemma and describe one such game. We will prove that this game is PSPACE-complete (and explain what this means) by providing the tools and method for our reduction. |
|
