AI, Data Science & Cloud Certificates from Google, IBM & Meta
The Fastest Way to Become a Backend Developer Online
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the fundamentals of arithmetic Ramsey theory in this graduate-level lecture from the IAS/PCMI Park City Mathematics Institute. Begin with classical results proven through color focusing arguments, including van der Waerden's theorem which guarantees monochromatic k-term arithmetic progressions in any finite coloring of the integers. Progress to modern tools from additive combinatorics and learn to apply them in proving that various linear and nonlinear configurations are density or partition regular, with emphasis on achieving good quantitative bounds. Examine Ramsey-theoretic questions concerning arithmetic configurations in abelian groups as part of a comprehensive course on extremal and probabilistic combinatorics. Benefit from lecture notes and problem sets provided through the PCMI program, designed for graduate students with some background in Fourier analysis, particularly on finite abelian groups. This first part of the series establishes foundational concepts before advancing to more sophisticated techniques in subsequent lectures.
Syllabus
Pt. 1 – Arithmetic Ramsey theory | Sarah Peluse, Stanford University | IAS/PCMI
Taught by
IAS | PCMI Park City Mathematics Institute