English

An update on the sum-product problem

Number Theory 2021-09-03 v2 Combinatorics

Abstract

We improve the best known sum-product estimates over the reals. We prove that max(A+A,AA)A43+21167o(1), \max(|A+A|,|AA|)\geq |A|^{\frac{4}{3} + \frac{2}{1167} - o(1)}\,, for a finite ARA\subset \mathbb R, following a streamlining of the arguments of Solymosi, Konyagin and Shkredov. We include several new observations to our techniques. Furthermore, AA+AAA12780o(1). |AA+AA|\geq |A|^{\frac{127}{80} - o(1)}\,. Besides, for a convex set AA we show that A+AA3019o(1). |A+A|\geq |A|^{\frac{30}{19}-o(1)}\,. This paper is largely self-contained.

Keywords

Cite

@article{arxiv.2005.11145,
  title  = {An update on the sum-product problem},
  author = {Misha Rudnev and Sophie Stevens},
  journal= {arXiv preprint arXiv:2005.11145},
  year   = {2021}
}

Comments

19 pages, refereed version

R2 v1 2026-06-23T15:44:20.164Z