Note on a Generalization of Roth’s Theorem

By József Solymosi. 2003

66 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/3e8dedd6759ed867fc167c633c8b4814457dacfc

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. Terence Tao
2. Ben Green
3. Ilya D. Shkredov
4. Sanghyuk Lee
5. Ben Joseph Green
6. Jonathan Bennett
7. Shuanglin Shao
8. Ana Vargas

In Discrete Mathematics and Combinatorics

1. Terence Tao
2. Ilya D. Shkredov
3. Ben Green
4. Ben Joseph Green
5. Nikos Frantzikinakis
6. Van H. Vu
7. Tom Sanders
8. William T. Gowers

In Geometry and Topology

1. Terence Tao
2. Ben Green
3. Ilya D. Shkredov
4. Ben Joseph Green
5. Tom Sanders
6. Nikos Frantzikinakis
7. Ulrich Kohlenbach
8. B. Host

Citations in the corpus

• Finite field models in additive combinatorics (2004, background): “, N} containing no corner ((x, y), (x + d, y), (x, y + d)), d 6= 0? Ajtai and Szemerédi [2] proved that r∠(N) = o(N), and various subsequent authors [54, 64] have obtained explicit bounds of the shape r∠(N) ≪ N/(log∗ N).”
• On a Generalization of Szemerédi's Theorem (2005, background): “The following theorem was proven in [16, 17] (see also [18, 21]).”
• The Gaussian primes contain arbitrarily shaped constellations (2005, background): “However, as observed in [16], [17], [18], [1], [8], [15], it is in fact relatively easy to deduce the former from the latter, and we include a proof below for the reader’s convenience.”