University of Cambridge > Talks.cam > Number Theory Seminar > Finding three-term arithmetic progressions in dense sets of integers

Finding three-term arithmetic progressions in dense sets of integers

Add to your list(s) Download to your calendar using vCal

  • UserThomas Bloom (Cambridge)
  • ClockTuesday 22 January 2019, 14:30-15:30
  • HouseMR13.

If you have a question about this talk, please contact Beth Romano.

One of the most famous theorems in arithmetic combinatorics is Roth’s theorem: any dense set of integers contains infinitely many non-trivial three-term arithmetic progressions. Since its first proof in 1953, a great deal of effort has gone into improving the quantitative bounds. I will give an overview of the methods used, the history of the bounds obtained, and the current state of the art.

This talk is part of the Number Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity