![[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)
Monday 23 November 2009, 16:00-17:00
Sum-product theorems for polynomials
- 👤 Speaker: Boris Bukh (University of Cambridge)
- 📅 Date & Time: Monday 23 November 2009, 16:00 - 17:00
- 📍 Venue: MR4, CMS
Questions? Contact
Boris Bukh
Abstract
Suppose A is a set of numbers and f(x,y) is a polynomial, how small can f(A,A) be? If f(x,y)=x+y or f(x,y)=xy, then f(A,A) can be very small indeed if A is a progression. However, Erdős and Szemerédi proved that A+A and AA cannot be simultaneously small when A is a set of real numbers. Their results has been generalized to other rings, and have found numerous applications in number theory, combinatorics, theoretical computer science, and other fields.
In this talk, I will survey the classical sum-product estimates, and will discuss several new results for other polynomial functions f. Joint work with Jacob Tsimerman.
Series This talk is part of the Discrete Analysis Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Discrete Analysis Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR4, CMS
- School of Physical Sciences
Note: Ex-directory lists are not shown.