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

Graduate Seminar
Misha Lavrov Carnegie Mellon University Title: Hindman's Theorem Again Abstract: In this talk, I will revisit Hindman's theorem, which we all remember from about a month ago, from a combinatorial point of view. I will prove a few finite and infinite variants of Hindman's theorem, and end with a proof of the theorem that is too settheoretical for my taste, and probably too combinatorial for set theorists. I will also briefly touch upon the question of whether the natural numbers begin with 0 or 1. Date: Thursday, October 10, 2013 Time: 5:30 pm Location: Wean Hall 8220 Submitted by: Brian Kell 