# Members’ Colloquium

## Higher order Fourier analysis and solving equations in dense sets

Several of the most important problems in combinatorial number theory ask for the size of the largest subset of some abelian group or interval of integers lacking points in some arithmetic configuration. One example of such a question is "What is the largest subset of $\{1,\cdots,N\}$ with no nontrivial $k$-term arithmetic progressions $x,x+y,...,x+(k-1)y$?". Gowers initiated the study of higher order Fourier analysis while seeking to answer this question and used it to give the first reasonable quantitative bounds.

### Date & Time

October 18, 2021 | 2:00pm – 3:00pm

### Location

Simonyi Hall 101 and Remote Access

### Speaker Affiliation

Institute for Advanced Study and Princeton University; Veblen Research Instructor, School of Mathematics