The HADES seminar on Tuesday, April 14th, will be at 3:30pm in Room 740.
Speaker: James Leng
Abstract: Let $r_k(N)$ denote the largest subset of the integers from $1$ to $N$ without a $k$-term arithmetic progression. A famous open problem is to find optimal upper bounds on $r_k(N)$. In this talk, I will survey work leading up to the current best upper bounds. Of particular note is the inverse theory of Gowers norms, which I will motivate through both finitary combinatorics and ergodic theory. Time permitting, I will end off by describing my favorite open problem in this area.