Roth’s theorem on progressions revisited

2008/01/01 by Jean Bourgain · 9 citations
Mathematics · Engineering · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #graph theory and CDMA systems

paper · doi:10.1007/s11854-008-0020-x

Cited by

• Roth-type theorem for quadratic system in Piatetski-Shapiro primes
• Translation invariant equations and the method of Sanders
• A probabilistic technique for finding almost-periods of convolutions
• New bounds for Szemerédi's theorem, III: A polylogarithmic bound for r₄(N)
• Tower-type bounds for Roth's theorem with popular differences
• Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
• Translation invariant quadratic forms in dense sets
• Some Ramsey results for the n-cube
• The structure of critical sets for F_p arithmetic progressions
• On solution-free sets for simultaneous diagonal polynomials