Abstract
The second lecture will cover the breakthrough upper bound for the size of three-term progression free subset of F_p^n of Ellenberg and Gijswijt. The lecture will present a reformulation of the proof of this bound due to Tao, using the so-called slice rank polynomial method. Additional applications of this method will also be discussed, for example to the so-called Erdös-Szemerédi sunflower problem in extremal set theory.
