On triples in arithmetic progression
From MaRDI portal
Publication:1964140
DOI10.1007/s000390050105zbMath0959.11004OpenAlexW1996922551WikidataQ56341560 ScholiaQ56341560MaRDI QIDQ1964140
Publication date: 3 February 2000
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000390050105
Related Items
Structure and regularity for subsets of groups with finite VC-dimension ⋮ Approximate groups and doubling metrics ⋮ Polynomial configurations in subsets of random and pseudo-random sets ⋮ Logarithmic bounds for Roth's theorem via almost-periodicity ⋮ Additive combinatorics and graph theory ⋮ Perfect Hash Families: Constructions and Existence ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ Some Properties of Lower Level-Sets of Convolutions ⋮ The equidistant dimension of graphs ⋮ A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On certain other sets of integers ⋮ Solving equations in dense Sidon sets ⋮ A generalization of Roth's theorem in function fields ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ Sets in \(\mathbb{Z}^k\) with doubling \(2^k + \delta\) are near convex progressions ⋮ Additive structures in sumsets ⋮ The quantitative behaviour of polynomial orbits on nilmanifolds ⋮ Injective colorings with arithmetic constraints ⋮ Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes ⋮ Extremal Sidon sets are Fourier uniform, with applications to partition regularity ⋮ A Note on Freĭman's Theorem in Vector Spaces ⋮ Quantitative structure of stable sets in finite abelian groups ⋮ The Kelley-Meka bounds for sets free of three-term arithmetic progressions ⋮ Roth-type theorem for quadratic system in Piatetski-Shapiro primes ⋮ A quantitative version of the non-Abelian idempotent theorem ⋮ NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR ⋮ Restriction theory of the Selberg sieve, with applications ⋮ On Roth's theorem on progressions ⋮ On Systems of Complexity One in the Primes ⋮ Progression-free sets in finite abelian groups. ⋮ Unnamed Item ⋮ An inverse theorem for the Gowers \(U^{s+1}[N\)-norm] ⋮ Density and Ramsey type results on algebraic equations with restricted solution sets ⋮ Finding large 3-free sets. I. The small \(n\) case ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The Erdős–Moser Sum-free Set Problem ⋮ Roth's theorem on progressions revisited ⋮ On the spectral gap and the diameter of Cayley graphs ⋮ The NOF multiparty communication complexity of composed functions ⋮ Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small ⋮ The Littlewood-Gowers problem ⋮ The structure theory of set addition revisited ⋮ An improved construction of progression-free sets ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ Nil Bohr\(_0\)-sets and polynomial recurrence ⋮ ON IMPROVING ROTH'S THEOREM IN THE PRIMES ⋮ A lower bound for off-diagonal van der Waerden numbers ⋮ Roth's theorem in many variables ⋮ ADDITIVE DIMENSION AND A THEOREM OF SANDERS ⋮ A subexponential upper bound for van der Waerden numbers \(W(3,k)\) ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ What is good mathematics? ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ A Freĭman-type theorem for locally compact Abelian groups ⋮ AN INVERSE THEOREM FOR THE GOWERSU4-NORM ⋮ Improved bound in Roth's theorem on arithmetic progressions ⋮ A new proof of Roth’s theorem on arithmetic progressions ⋮ Popular differences for corners in Abelian groups ⋮ A Prime Analogue of Roth’s Theorem in Function Fields ⋮ ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING ⋮ Arithmetic progressions, different regularity lemmas and removal lemmas ⋮ Roth's theorem in the Piatetski-Shapiro primes ⋮ Bootstrapping partition regularity of linear systems ⋮ LINEAR FORMS AND QUADRATIC UNIFORMITY FOR FUNCTIONS ON ⋮ Bounds in Cohen's idempotent theorem ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ On finite sets of small tripling or small alternation in arbitrary groups ⋮ A Roth-type theorem with mixed powers ⋮ On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets ⋮ On sets of integers which contain no three terms in geometric progression ⋮ MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS ⋮ From harmonic analysis to arithmetic combinatorics ⋮ Exploring the toolkit of Jean Bourgain ⋮ Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\) ⋮ Every odd number greater than $1$ is the sum of at most five primes ⋮ The cardinality of restricted sumsets.
