University of Cambridge > > Combinatorics Seminar > On sumsets of convex sets

On sumsets of convex sets

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

  • UserJózsef Solymosi (University of British Columbia)
  • ClockThursday 27 January 2011, 15:00-16:00
  • HouseMR12.

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

A set of real numbers, a_1 < a_2 < ... < a_n, is said to be convex if the gap between the numbers is increasing. (a_{i+2}-a_{i+1} > a_i-a_{i-1} for any 1 < i < n-1)

We will show that if a set of real numbers, A, is convex then its sumset is always large, |A+A|>|A|^{3/2+\delta} holds for some universal constant \delta>0.

Joint work with Endre Szemerédi

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-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity