A list of topics. The first half is essentially fixed and the second half is very open to suggestions. We will spend half to two-thirds of the class discussing some foundational topics (including proofs of Roth's and Freiman's theorems) and will spend the remainder discussing additional topics, including some of the very recent work in the subject. Feedback and suggestions highly encouraged!
Tao and Vu, Additive Combinatorics (book).
Sound's notes from 2006.
Gowers' notes (which Sound's notes were modelled on).
See also Terry Tao's blog and Gowers's blog.
We will be meeting Monday, April 4.
If needed (looks like it won't be, fortunately), makeup classes will be held after the end of the term (avoiding the Calgary, Edmonton, and AIM conferences in June) and/or on Tuesdays and Thursdays after the conclusion of the trial (or on days the court is off). Attendance at makeups will be optional.
Formal prerequisites for the subject are hard to quantify. I will aim my lectures at the math grad students, but others may be able to follow as well. The lectures might assume a knowledge of: elementary abstract algebra; enumerative combinatorics; complex and Fourier analysis; analytic number theory. Fluency in manipulating sums, identities, and inequalities will be assumed.
If you are trying to determine if your background is sufficient, please read the proof of Roth's theorem on pp. 10-12 of Sound's notes. If it mostly makes sense after a close reading (it's okay if you have a couple of questions) then you are probably reasonably prepared.
See also the homework exercises on Sound's website.