Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, July 02, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Marc Kaufmann (Imperial College London)
Given a large enough contiguous set of integers, any of its subsets with density at least 0 < δ ≤ 1 will contain a length k arithmetic progression. This is asserted by the celebrated Szemerédi Theorem. While its original proof is graph-theoretic in nature, we can arrive at the same conclusion by Fourier-analytic or Ergodic Theory means. Our talk follows the latter route, discussing a quantitative, finitary proof furnished by Terence Tao in 2004.
Automatic MiSe System Software Version 1.4803M | admin login