Sets without arithmetic progressions, and patterns in arithmetic progressions

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

• Christian Elsholtz (Graz)
• Thursday 05 May 2011, 14:30-15:30
• MR12.

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)²).

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.