A probabilistic technique for finding almost-periods of convolutions

DOI10.1007/s00039-010-0101-8zbMath1234.11013arXiv1003.2978MaRDI QIDQ616150

Ernie Croot, Olof Sisask

Publication date: 7 January 2011

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.2978

zbMATH Keywords

convolution; Roth's theorem; arithmetic progression; Freiman's theorem; Bogolyubov's method; product-set; sum-set

Mathematics Subject Classification ID

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

11B30: Arithmetic combinatorics; higher degree uniformity

Related Items

Structure of Protocols for XOR Functions, The structure theory of set addition revisited, Arithmetic Progressions in Sumsets and L^p-Almost-Periodicity, On finite sets of small tripling or small alternation in arbitrary groups, Quantitative structure of stable sets in finite abelian groups, The Erdős–Moser Sum-free Set Problem, Exponential sum estimates over prime fields, Optimality of linear sketching under modular updates, Additive energy of regular measures in one and higher dimensions, and the fractal uncertainty principle, Growth in groups: ideas and perspectives, Logarithmic bounds for Roth's theorem via almost-periodicity, An Additive Combinatorics Approach Relating Rank to Communication Complexity, Extractors in Paley graphs: a random model, Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset, A quantitative version of the non-Abelian idempotent theorem, On Roth's theorem on progressions, Additive combinatorics and graph theory, Sumsets of dense sets and sparse sets, The structure of approximate groups., Higher moments of convolutions, Roth's theorem in many variables, Coset decision trees and the Fourier algebra, A note on bilinear exponential sums in prime fields, Long regularly-spaced and convex sequences in dense sets of integers, Bounds in Cohen's idempotent theorem, Sums of multiplicative characters with additive convolutions, Noncommutative sets of small doubling, Finite field models in arithmetic combinatorics -- ten years on, ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS, ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, New bounds on cap sets, Some Properties of Lower Level-Sets of Convolutions, Growth and expansion in algebraic groups over finite fields, From Affine to Two-Source Extractors via Approximate Duality, Convolutions of sets with bounded VC-dimension are uniformly continuous, A question of Bukh on sums of dilates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roth's theorem on progressions revisited
• The tail of the hypergeometric distribution
• Generalized arithmetical progressions and sumsets
• Reconstructing integer sets from their representation functions
• A polynomial bound in Freiman's theorem.
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Product set estimates for non-commutative groups
• APPROXIMATE GROUPS, II: THE SOLVABLE LINEAR CASE
• ON A NONABELIAN BALOG–SZEMERÉDI-TYPE LEMMA
• On Certain Sets of Positive Density
• SETS WITH SMALL SUMSET AND RECTIFICATION
• Additive structures in sumsets
• On a problem of Konyagin
• Sums of Dilates
• Three-term arithmetic progressions and sumsets
• A new proof of Roth’s theorem on arithmetic progressions
• Integer Sum Sets Containing Long Arithmetic Progressions
• Freiman's theorem for solvable groups
• Freiman's theorem in an arbitrary abelian group
• Probability Inequalities for Sums of Bounded Random Variables
• On Certain Sets of Integers
• Arithmetic progressions in sumsets
• Arithmetic progressions in sumsets