Graduate Students
Graduate Programs     
Graduate Home Ph D Programs Masters Degree Ph D Program Requirements Course Descriptions Current Courses Admissions Current Graduate Students Graduate Student Seminar SIAM Chapter Seminar Recent Graduates Incoming Students

Apply Now
Graduate Seminar

Chris Cox
CMU
Title: Sperner's lemma and applications

Abstract: In this talk, we'll look at a very simple result known as Sperner's lemma. Roughly, the result states that if one colors the vertices of a triangulation of a polygon with three colors, then, under reasonable assumptions, there will always be a rainbow triangle. This simple combinatorial theorem can be proved in about one line, but can be applied to prove powerful theorems such as Brouwer's fixed-point theorem, the hairy-ball theorem and even the Fundamental Theorem of Algebra. Time permitting, we will apply Sperner's lemma to prove these theorems and may also discuss applications to envy-free division problems and the game of Hex.

Date: Tuesday, February 13, 2018
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Son Van