The Erdős-Szemerédi problem on sum set and product set

By Mei-Chu Chang. 2003

58 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/aee40a372d095bf9f80af032455b0418d5d2d87b

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. M. Rudnev
2. Ilya D. Shkredov
3. Oliver Roche-Newton
4. Sophie Stevens

In Discrete Mathematics and Combinatorics

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

In Geometry and Topology

1. M. Rudnev
2. Oliver Roche-Newton
3. Ilya D. Shkredov
4. Tom Sanders
5. Ben Joseph Green

Citations in the corpus

• Bounding multiplicative energy by the sumset (2009, unknown): “For integers, Chang [2] proved that there is a function δ(ε) that if |AA| |A|1+ε then |A + A| |A|2−δ, where δ → 0 if ε → 0.”
• New sum-product type estimates over finite fields (2014, result): “This furthered an earlier paper by Chang, [6], which showed that |A+A| & |A|2, given that |AA| does not exceed |A| by a just factor of log |A|.”