{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7854","name":"A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set","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)| > c|A|^2 \/ log |A|, where c is some positive constant. In particular, it follows that |(A + A)(A + A)| > c|A|^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\u00f6s distinct distance problem. Here, we do not use those relatively deep methods, and instead we need just a single application of the Szemer\u00e9di-Trotter Theorem. The result is also qualitatively stronger than the corresponding sum-product 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.","keywords":["Szemer\u00e9di-Trotter Theorem","pinned distances","sum-product estimates"],"author":{"@type":"Person","name":"Roche-Newton, Oliver","givenName":"Oliver","familyName":"Roche-Newton"},"position":9,"pageStart":74,"pageEnd":80,"dateCreated":"2015-06-12","datePublished":"2015-06-12","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Roche-Newton, Oliver","givenName":"Oliver","familyName":"Roche-Newton"},"copyrightYear":"2015","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.74","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6237","volumeNumber":34,"name":"31st International Symposium on Computational Geometry (SoCG 2015)","dateCreated":"2015-06-12","datePublished":"2015-06-12","editor":[{"@type":"Person","name":"Arge, Lars","givenName":"Lars","familyName":"Arge"},{"@type":"Person","name":"Pach, J\u00e1nos","givenName":"J\u00e1nos","familyName":"Pach"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7854","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6237"}}}