An update on the sum-product problem
- 11 October 2021
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 173 (2) , 411-430
Abstract
We improve the best known sum-product estimates over the reals. We prove that \[\max(|A+A|,|A+A|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,,\] for a finite $A\subset \mathbb {R}$ , following a streamlining of the arguments of Solymosi, Konyagin and Shkredov. We include several new observations to our techniques.Furthermore, \[|AA+AA|\geq |A|^{\frac{127}{80} - o(1)}\,.\] Besides, for a convex set A we show that \[|A+A|\geq |A|^{\frac{30}{19}-o(1)}\,.\] This paper is largely self-contained.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Variations on the Sum-Product ProblemSIAM Journal on Discrete Mathematics, 2015
- Some new results on higher energiesTransactions of the Moscow Mathematical Society, 2014
- A note on sum-product estimatesPublicationes Mathematicae Debrecen, 2011
- On Sumsets of Convex SetsCombinatorics, Probability and Computing, 2011
- On Additive Doubling and EnergySIAM Journal on Discrete Mathematics, 2010
- Bounding multiplicative energy by the sumsetAdvances in Mathematics, 2009
- The distribution of integers with a divisor in a given intervalAnnals of Mathematics, 2008
- Few sums, many productsStudia Scientiarum Mathematicarum Hungarica, 2003
- Extremal problems in discrete geometryCombinatorica, 1983
- On sums and products of integers1983