This is the page for a TCC module in Ergodic Ramsey Theory taught in Term 1 (Autumn) of 2021.
Lectures are 16:00-18:00 Thursdays starting October 14, held via MS Teams.
I will be teaching from room MB0.08 in the Mathematical Sciences building at Warwick, and local atendees are welcome to join in person.
If you are taking the module for assessment, please email me. Assessment will be based on exercises from the worksheets provided after each lecture. You should aim to complete an average of at least one exercise per week.
Please submit the solutions to my email firstname.lastname@example.org within 2 weeks of each class.
Ergodic Ramsey theory is a relatively new subject which applies ideas and techniques from ergodic theory to problems arising in Ramsey theory, combinatorics and number theory. The module will introduce the basics of this subject and build up to the ergodic theoretic proof of Szemeredi's theorem on arithmetic progressions discovered by Furstenberg. Depending on time and students preferences, the last half/third of the module will cover more recent developments in the field, including connections to multiplicative number theory, additive combinatorics or Higher Order Fourier Analysis.
Here are the full class notes.
We will liberally make use of basic tools from functional analysis, topology, analysis and measure theory (eg. the Riesz Representation theorem, Jensen's inequality, the Stone-Weierstrass theorem, the Dominated Convergence Theorem,...).
Familiarity with Ergodic Theory can be helpful but is not necessary to follow the module. In fact one of the goals of this module is to serve as a gateway into ergodic theory for people interested in Ramsey theory or additive combinatorics.
Familiarity with Ramsey Theory can equally be helpful but is not necessary since all Ramsey theoretic statements can (and will) be formulated in very basic terms.