Hindman's theorem is one of the classical results in combinatorial and additive number theory. The original proof, combinatorial and complicated, was greatly simplified by Glazer's observation that the theorem follows from the existence of an idempotent nonprincipal ultrafilter on the set of positive integers. This talk will explain Glazer's proof, and describe some related results and open problems.
Mel Nathanson