University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Iterated product sets with shifts

## Iterated product sets with shiftsAdd to your list(s) Download to your calendar using vCal - Oliver Roche-Newton (RICAM, Austria)
- Thursday 20 February 2020, 15:00-16:00
- Watson LTA.
If you have a question about this talk, please contact Richard Montgomery. An important variant of the sum-product problem is the following: given a finite set A, show that either its product set is large, or any translate of A has large product set. I will discuss a joint work with Hanson and Zhelezov, in which we prove bounds for this problem with many variables in the rational setting. The proof is based on a deep work of Bourgain and Chang on the sum-product problem, although the analysis has thankfully now been greatly simplified owing to a new result of Palvolgyi and Zhelezov which gives powerful structural information about sets of rationals with small product sets. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsBham Talks Beverley Glover Human Computer Interaction seminars## Other talksTBC When less is more - reduced physics simulations of the solar wind Perfect matchings in random sparsifications of Dirac hypergraphs The development of an optically pumped magnetometer based MEG system Sensing and metrology activities at NPL, India Geometry of alternating projections in metric spaces with bounded curvature |