Bounding multiplicative energy by the sumset

By József Solymosi. 2009

180 citations recorded by the source corpus.

Abstract We prove that the sumset or the productset of any finite set of real numbers, A, is at least | A | 4 / 3 − e , improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, E ( A , A ) .

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/223b259202a15d4db0d72f47aca1c4a535f94ee2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Sophie Stevens
  2. Ilya D. Shkredov
  3. M. Rudnev
  4. Oliver Roche-Newton
  5. Brendan Murphy
  6. Giorgis Petridis
  7. E. Yazici
  8. Frank de Zeeuw

In Discrete Mathematics and Combinatorics

  1. Ilya D. Shkredov
  2. Sophie Stevens
  3. M. Rudnev
  4. Brendan Murphy
  5. Oliver Roche-Newton
  6. E. Yazici
  7. Giorgis Petridis
  8. Frank de Zeeuw

In Geometry and Topology

  1. M. Rudnev
  2. Sophie Stevens
  3. Oliver Roche-Newton
  4. Brendan Murphy
  5. Ilya D. Shkredov
  6. Tom Sanders
  7. Ben Joseph Green

Citations in the corpus