Title: Density versions of Hindman’s sumset theorem
Abstract: In 1973, Hindman proved that for any finite partition of the natural numbers
$C_1 \cup \cdots \cup C_r$, there exists a color $C_i$ containing all finite sums of distinct elements from some infinite set B.
In this talk, we present several density versions of this theorem developed by B. Kra, J. Moreira, F. Richter, and D. Robertson, as well as some new results obtained in joint work with F. Hernández and I. Kousek.
We will also discuss some of the basic dynamical tools used in the proofs.
Note: The talk will start at 4:10 pm
Daniel Mallory
Email