Speaker
Jihyo Chae
(Yonsei University)
Description
The Gowers uniformity norm has played a significant role in additive combinatorics as a measure of randomness associated with solution sets of certain linear configurations. In this talk, I introduce the notion of Gowers uniformity norms and demonstrate how they capture additive structures in a given set of integers. Gowers norms capture additive structures both through k-term arithmetic progression counts and through their connection to polynomial Freiman–Ruzsa via Gowers inverse theorems. I present applications of Gowers norms in both directions.
