Abstract
In this note it is established that, for any finite set A of real numbers, there exist two elements a, b from A such that (a + A)(b + A) > cA^2 / log A, where c is some positive constant. In particular, it follows that (A + A)(A + A) > cA^2 / log A. The latter inequality had in fact already been established in an earlier work of the author and Rudnev, which built upon the recent developments of Guth and Katz in their work on the Erdös distinct distance problem. Here, we do not use those relatively deep methods, and instead we need just a single application of the SzemerédiTrotter Theorem. The result is also qualitatively stronger than the corresponding sumproduct estimate from the paper of the author and Rudnev, since the set (a + A)(b + A) is defined by only two variables, rather than four. One can view this as a solution for the pinned distance problem, under an alternative notion of distance, in the special case when the point set is a direct product A x A. Another advantage of this more elementary approach is that these results can now be extended for the first time to the case when A is a set of complex numbers.
BibTeX  Entry
@InProceedings{rochenewton:LIPIcs:2015:5120,
author = {Oliver RocheNewton},
title = {{A Short Proof of a NearOptimal Cardinality Estimate for the Product of a Sum Set}},
booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)},
pages = {7480},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783939897835},
ISSN = {18688969},
year = {2015},
volume = {34},
editor = {Lars Arge and J{\'a}nos Pach},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5120},
URN = {urn:nbn:de:0030drops51200},
doi = {10.4230/LIPIcs.SOCG.2015.74},
annote = {Keywords: Szemer{\'e}diTrotter Theorem, pinned distances, sumproduct estimates}
}
Keywords: 

SzemerédiTrotter Theorem, pinned distances, sumproduct estimates 
Seminar: 

31st International Symposium on Computational Geometry (SoCG 2015) 
Issue Date: 

2015 
Date of publication: 

11.06.2015 