University of Cambridge > Talks.cam > Combinatorics Seminar > Sets without arithmetic progressions, and patterns in arithmetic progressions

Sets without arithmetic progressions, and patterns in arithmetic progressions

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

  • UserChristian Elsholtz (Graz)
  • ClockThursday 05 May 2011, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We give a survey of several recent results in the area of sets with or without arithmetic progressions. In one of these we study the maximal size of an iterated sumset in a set without arithmetic progressions. As an application we improve a result of Hegyvari and Sarkozy on the maximal dimension in a Hilbert cube in the set of squares in [1,N] from d=O((log N)1/3) to O((log log N)2).

This talk is part of the Combinatorics 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