Graduate Students
Department Home Undergraduate Graduate CNA CCF Information
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

Andy Zucker
Carnegie Mellon University
Title: Hindman's Theorem

Abstract: Hindman's Theorem is pretty easy to state: color the natural numbers with finitely many colors. Then we can find an infinite subset X such that for every nonempty finite subset S of X, the sum of the elements of S is the same color. However, the proof draws upon seemingly unrelated areas of math, in particular the study of topological semigroups. I will introduce some of the basic facts of topological semigroups and use them to prove Hindman's theorem. No background other than some point-set topology is required.

Date: Thursday, September 12, 2013
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Brian Kell