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