Papers
Topics
Authors
Recent
Search
2000 character limit reached

An update on the sum-product problem

Published 22 May 2020 in math.NT and math.CO | (2005.11145v2)

Abstract: We improve the best known sum-product estimates over the reals. We prove that [ \max(|A+A|,|AA|)\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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.