On the size of k-fold sum and product sets of integers

By Jean Bourgain, Mei-Chu Chang. 2003

67 citations recorded by the source corpus.

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ... \cdot A| \geq |A|^b$$ where $A + ... + A$ and $A \cdot ... \cdot A$ are the collections of $k$-fold sums and products of elements of $A$ respectively. This is progress towards a conjecture of Erdos and Szemeredi on sum and product sets.

Subfields: Computer Vision and Pattern Recognition, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/12fe69829c5512c84ee6425c7c0a705b90a17ce6

How researchers see this paper

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

In Computer Vision and Pattern Recognition

  1. Oliver Roche-Newton
  2. Ilya D. Shkredov
  3. M. Rudnev
  4. Terence Tao
  5. E.J. Candes
  6. Richard Baraniuk
  7. Justin K. Romberg
  8. Yonina C. Eldar

In Discrete Mathematics and Combinatorics

  1. Ilya D. Shkredov
  2. Terence Tao
  3. Ben Joseph Green
  4. William T. Gowers
  5. M. Rudnev
  6. Nikos Frantzikinakis
  7. B. Host
  8. Brendan Murphy

In Geometry and Topology

  1. Terence Tao
  2. Ben Joseph Green
  3. Ilya D. Shkredov
  4. William T. Gowers
  5. M. Rudnev
  6. Nikos Frantzikinakis
  7. Tom Sanders
  8. Oliver Roche-Newton

Citations in the corpus