Abstract
The first lecture set the scene for a proof of Roth's theorem. One of the tools presented was discrete Fourier analysis, which is used to distinguish quasi-random from more structured sets, and a lemma which shows that, for any linear function of phase f, there exists a partition of the set {1,2,...,n} into long arithmetic progressions in each of which f is approximately constant.
