SIAM Journal on Discrete Mathematics · 2015 · 28 citations · 26 references
Natural SciencesComputer ScienceMathematicsCombinatoricsNumber TheorySet TheoryCombinatorial Number TheoryNumber-theoretic Algorithms
This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$ giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that $|A(A+A+A+A)|\gg{\frac{|A|^2}{\log{|A|}}},$ a bound which is optimal up to constant and logarithmic factors. We also prove several new results concerning sum-product estimates and expanders, for example, showing that $|A(A+a)|\gg{|A|^{3/2}}$ holds for a typical element of $A$.
26
Extremal problems in discrete geometry
Endre Szemerédi, W. T. Trotter · COMBINATORICA · 1983 · 556 citations
On the Erdős distinct distances problem in the plane
Larry Guth, Nets Hawk Katz · Annals of Mathematics · 2014 · 333 citations · Full text
On the number of sums and products
György Elekes · Acta Arithmetica · 1997 · 202 citations · Full text
Bounding multiplicative energy by the sumset
József Solymosi · Advances in Mathematics · 2009 · 148 citations