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

Iterated product sets with shifts

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

  • UserOliver Roche-Newton (RICAM, Austria)
  • ClockThursday 20 February 2020, 15:00-16:00
  • HouseWatson 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.