Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login