Course Description and Grading Breakdown
This term we will study three topics. We will spend the first five weeks of the course on the probabilistic method in combinatorics. The next two weeks will be spent on the Szemeredi regularity theorem and applications. The final three weeks will be spent on an introduction to additive combinatorics. There will be
four problem sets assigned, two for the first topic and one for each of the others. Each set will count equally and the final grade in the course will be
determined entirely based on the homework.
Tuesday and Thursday
1:00 - 2:25 pm
255 Linde
Course Instructor Contact Information and Office Hours
164 Linde Hall
Wednesday 7-8
Course Schedule and Textbook
Course Policies
Late work -
Assignments
Solutions to Problem Set 2 can be found on pages 138-144 here. As Ben Krause says, it builds character.
Bourgain
Notes
Here are Croot's notes on the Szemeredi Regularity Theorem:
Croot
Here are notes of Shagnik Das on applications of the regularity lemma.
Das
Here is a survey of Conlon and Fox on graph removal lemmas.
Conlon-Fox
Here are some notes for a lecture to Chinese high school students. Ignore the part about logistics of studying mathematics. [This was supposed to please their parents.] The
mathematical part will form the basis for my first lecture on additive combinatorics. NetsChina1
Collaboration Table
* You may use a computer or calculator while doing the homework, but may not refer to this as justification for your work. For example, "by Mathematica" is not an acceptable justification for deriving one equation from another. Also, since computers and calculators will not be allowed on the exams, it's best not to get too dependent on them. |