University of Cambridge > > Discrete Analysis Seminar > Roth's theorem on arithmetic progressions

Roth's theorem on arithmetic progressions

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

  • UserTom Sanders (University of Cambridge)
  • ClockTuesday 23 November 2010, 17:30-18:30
  • HouseMR4, CMS.

If you have a question about this talk, please contact Pablo Candela.

We shall discuss upper bounds for the size of the largest subset of the positive integers less than some integer N not containing any triple of distinct elements in arithmetic progression.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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