COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Discrete Analysis Seminar > Sum-product theorems for polynomials

## Sum-product theorems for polynomialsAdd to your list(s) Download to your calendar using vCal - Boris Bukh (University of Cambridge)
- Monday 23 November 2009, 16:00-17:00
- MR4, CMS.
If you have a question about this talk, please contact Boris Bukh. 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. This talk is part of the Discrete Analysis Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Discrete Analysis Seminar
- MR4, CMS
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsTheory - Chemistry Research Interest Group Centre for Science and Policy Seminars Turkish-Armenian Relations. Facing History: Denial as a Security Concept## Other talksLanguage Adaptation experiments: Cross-lingual embeddings for related languages Knowledge on wild plants in BaYaka hunter-gatherers and its implications on cultural evolution and health Exploring the mechanisms of haematopoietic lineage progression at the single-cell level Large Scale Ubiquitous Data Sources for Crime Prediction Computational Models—who needs them? Zoo and Wildlife Work |