Roth’s theorem on progressions revisited

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Journal d'Analyse Mathématique

• Publication date

  Unknown publication date

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1007/S11854-008-0020-X
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Appendix to ‘Roth’s theorem on progressions revisited,’ by

  2008cited by this paper
• Appendix to ‘Roth’s theorem on progressions revisited,’ by J. Bourgain

  2007cited by this paper
• Additive Combinatorics: Long arithmetic progressions in sum sets

  2006cited by this paper
• A Note on Freĭman's Theorem in Vector Spaces

  2006cited by this paper
• A polynomial bound in Freiman's theorem

  2002cited by this paper
• On Triples in Arithmetic Progression

  1999influential reference
• A Tribute to Paul Erdős: On arithmetic progressions in sums of sets of integers

  1990cited by this paper
• Integer Sets Containing No Arithmetic Progressions

  1987influential reference
• On Certain Sets of Integers

  1953influential reference

• Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics

  2025cites this paper
• Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields

  2024cites this paper
• Past and future of the cap set problem

  2024cites this paper
• On the size of sets avoiding a general structure

  2024cites this paper
• Improved Bounds for Szemer\'{e}di's Theorem

  2024cites this paper
• Finite field models in arithmetic combinatorics -- twenty years on

  2023cites this paper
• Discrete Analogues in Harmonic Analysis

  2023cites this paper
• Improved bounds for five-term arithmetic progressions

  2023cites this paper
• Roth-type theorem for quadratic system in Piatetski-Shapiro primes

  2023cites this paper
• Essentially tight bounds for rainbow cycles in proper edge‐colourings

  2023cites this paper
• Strong Bounds for 3-Progressions

  2023cites this paper
• Characterisation of Meyer sets via the Freiman–Ruzsa theorem

  2023cites this paper
• Additive dimension and the growth of sets

  2022cites this paper
• Sums of linear transformations

  2022cites this paper
• Sums of transcendental dilates

  2022cites this paper
• Recent progress on bounds for sets with no three terms in arithmetic progression

  2022cites this paper
• Roth's theorem and the Hardy–Littlewood majorant problem for thin subsets of Primes

  2022cites this paper
• Bohr 0 -sets and polynomial recurrence.

  2022cites this paper
• Almost periodicity and its applications to Roth’s theorem

  2020influential citation
• A Roth-type theorem with mixed powers

  2020cites this paper
• Tower-type bounds for Roth’s theorem with popular differences

  2020cites this paper
• Bounds in Cohen’s Idempotent Theorem

  2020cites this paper
• Improved bound in Roth's theorem on arithmetic progressions

  2020cites this paper
• Fermat's Last Theorem guarantees primes

  2020cites this paper
• On the size of A+λA for algebraic λ

  2020cites this paper
• Fermat’s Last Theorem Implies Euclid’s Infinitude of Primes

  2020cites this paper
• Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions.

  2020influential citation
• A Roth-type theorem with mixed powers

  2019cites this paper
• Logarithmic bounds for Roth's theorem via almost-periodicity

  2018influential citation
• Linear, bilinear and polynomial structures in function fields and the primes

  2018cites this paper
• New applications of the polynomial method: The cap set conjecture and beyond

  2018cites this paper
• Additive Combinatorics and its Applications in Theoretical Computer Science

  2017cites this paper
• Tight bounds on additive Ramsey‐type numbers

  2017cites this paper
• Secure Computation Based on Leaky Correlations: High Resilience Setting

  2017cites this paper
• A new lower bound for van der Waerden numbers

  2017cites this paper
• New bounds for Szemer\'edi's theorem, III: A polylogarithmic bound for $r_4(N)$

  2017cites this paper
• ROTH’S THEOREM ON ARITHMETIC PROGRESSIONS

  2017cites this paper
• Generalizations of Fourier analysis, and how to apply them

  2016cites this paper
• Bounds in Cohen’s Idempotent Theorem

  2016cites this paper
• A Prime Analogue of Roth’s Theorem in Function Fields

  2015influential citation
• Erd\H{o}s and Arithmetic Progressions

  2015cites this paper
• Structure theorems in additive combinatorics

  2015influential citation
• INTRODUCTION TO SUM-PRODUCT PHENOMENON AND ARITHMETICAL APPLICATIONS

  2015cites this paper
• ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS

  2014cites this paper
• A Density Increment Approach to Roth's Theorem in the Primes

  2014influential citation
• A quantitative improvement for Roth's theorem on arithmetic progressions

  2014cites this paper
• C O ] 8 A pr 2 01 4 Additive dimension and a theorem of Sanders By

  2014cites this paper
• On the Additive Volume of Sets of Integers

  2014cites this paper
• Nil Bohr0-sets and polynomial recurrence

  2014cites this paper
• Enumeration of three term arithmetic progressions in fixed density sets

  2014cites this paper
• Enumeration of three term arithmetic progressions in fixed density sets

  2014influential citation
• ADDITIVE DIMENSION AND A THEOREM OF SANDERS

  2014cites this paper
• Additive problems in abelian groups

  2014cites this paper
• Finding Linear Patterns of Complexity One

  2013cites this paper
• Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition

  2013cites this paper
• A generalization of sets without long arithmetic progressions based on Szekeres algorithm

  2013cites this paper
• On Improving Roth's Theorem in the Primes

  2013cites this paper
• Translation invariant quadratic forms in dense sets

  2013cites this paper
• Erd˝ os and Arithmetic Progressions

  2013cites this paper
• Roth's theorem on 3-arithmetic progressions in the integers

  2013cites this paper
• Roth's Theorem in the Piatetski-Shapiro primes

  2013cites this paper
• Roth’s theorem in many variables

  2013cites this paper
• Erdős and Arithmetic Progressions

  2013cites this paper
• ON A DIAGONAL QUADRIC IN DENSE VARIABLES

  2013influential citation
• Paul Erdős and the Difference of Primes

  2013cites this paper
• Structure Theory of Set Addition III. Results and Problems

  2012cites this paper
• Higher Order Fourier Analysis

  2012cites this paper
• The Removal Lemma: algebraic versions and applications

  2012cites this paper
• Threshold functions and Poisson convergence for systems of equations in random sets

  2012cites this paper
• On arithmetic progressions in A + B + C

  2012cites this paper
• Asymptotic estimates for rational spaces on hypersurfaces in function fields

  2012cites this paper
• A generalization of Roth's theorem in function fields

  2012cites this paper
• The structure theory of set addition revisited

  2012cites this paper
• Threshold functions for systems of equations on random sets

  2012cites this paper
• On certain other sets of integers

  2012cites this paper
• Additive combinatorics with a view towards computer science and cryptography: An exposition

  2011cites this paper
• Translation invariant equations and the method of Sanders

  2011influential citation
• Задача Эрдеша - Хайнала о раскрасках гиперграфов, ее обобщения и смежные проблемы@@@The Erdős - Hajnal problem of hypergraph colouring, its generalizations, and related problems

  2011cites this paper
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems

  2011cites this paper
• Roth’s theorem in many variables

  2011cites this paper
• Décompositions de graphes : quelques limites et obstructions

  2011cites this paper
• A survery of Roth ’ s theorem on progressions of length three by Yui Nishizawa

  2011cites this paper
• Groupes, courbes et croissance

  2011cites this paper
• A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II)

  2011influential citation
• Ergodic-theoretic implementations of the Roth density-increment argument

  2011cites this paper
• On families of weakly dependent random variables

  2011cites this paper
• Solution‐free sets for sums of binary forms

  2011cites this paper
• On one result of J. Bourgain

  2010cites this paper
• On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs

  2010influential citation
• A PROBABILISTIC TECHNIQUE FOR FINDING ALMOST-PERIODS IN ADDITIVE COMBINATORICS

  2010cites this paper
• Some applications of W. Rudin's inequality to problems of combinatorial number theory

  2010cites this paper
• Some Ramsey-type results for the n-cube

  2010cites this paper
• Fourier analysis in combinatorial number theory

  2010cites this paper
• On some microlocal properties of the range of a pseudo-differential operator of principal type

  2010cites this paper
• On subsets of F1n containing no k-term progressions

  2010cites this paper
• A Probabilistic Technique for Finding Almost-Periods of Convolutions

  2010cites this paper
• On the Bogolyubov–Ruzsa lemma

  2010cites this paper
• Regular partitions of hypergraphs and property testing

  2010cites this paper
• On certain other sets of integers

  2010influential citation
• On Roth's theorem on progressions

  2010cites this paper