- Series
- Job Candidate Talk
- Time
- Thursday, December 4, 2014 - 2:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Choongbum Lee – MIT
- Organizer
- William T. Trotter
The Hales--Jewett theorem is one of the pillars of Ramsey theory, from
which many other results follow.
A celebrated result of Shelah from 1988 gives a significantly improved
bound for this theorem. A key tool used in his proof, now known as the cube
lemma, has become famous in its own right. Hoping to further improve
Shelah's result, more than twenty years ago, Graham, Rothschild and Spencer
asked whether there exists a polynoimal bound for this lemma. In this talk,
we present the answer to their question and discuss numerous connections of
the cube lemma with other problems in Ramsey theory.
Joint work with David Conlon (Oxford), Jacob Fox (MIT), and Benny Sudakov
(ETH Zurich).