Abstract
The second lecture completed the proof of Roth's theorem. This was followed by an example, by Behrend, of the densest known set that does not contain an arithmetic progression of length 3. Another example was then presented, this one illustrating that the " linear " techniques are not sufficient to deal with arithmetic progressions of length 4.
