Finite and infinite arithmetic progressions in sumsets

By Endre Szemerédi, Van H. Vu. 2006

59 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/905312dfebb93dafe23892950b13db5d39f8d223

How researchers see this paper

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

In Algebra and Number Theory

1. Tomasz Schoen
2. Van H. Vu
3. Endre Szemerédi
4. Benny Sudakov
5. Tom Sanders

In Computational Theory and Mathematics

1. Tomasz Schoen
2. Van H. Vu
3. Endre Szemerédi
4. Benny Sudakov
5. Tom Sanders
6. Ilya D. Shkredov

In Discrete Mathematics and Combinatorics

1. Tomasz Schoen
2. Van H. Vu
3. Endre Szemerédi
4. Benny Sudakov
5. Tom Sanders
6. Terence Tao
7. Ilya D. Shkredov
8. L. Erdős

Citations in the corpus

• Near optimal bounds in Freiman's theorem (2011, background): “Freiman’s theorem have a plethora of deep applications to many important problems as the recent one from the papers of Gowers [12], [13] who used it to get an effective version of Szemerédi’s theorem (for further papers which make an important use of Freiman’s result see for example [4], [6],[26], [”
• On a question of Erdős and Moser (2005, background): “Let us start with a definition that, in a slightly different form, first appeared in [15].”