![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
József Solymosi (University of British Columbia)
Thursday 27 January 2011, 15:00-16:00
On sumsets of convex sets
- 👤 Speaker: József Solymosi (University of British Columbia)
- 📅 Date & Time: Thursday 27 January 2011, 15:00 - 16:00
- 📍 Venue: MR12
Questions? Contact
Andrew Thomason
Abstract
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
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.