A probabilistic technique for finding almost-periods of convolutions
From MaRDI portal
Publication:616150
DOI10.1007/s00039-010-0101-8zbMath1234.11013arXiv1003.2978OpenAlexW2161591058MaRDI QIDQ616150
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
convolutionRoth's theoremarithmetic progressionFreiman's theoremBogolyubov's methodproduct-setsum-set
Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (38)
A note on bilinear exponential sums in prime fields ⋮ Logarithmic bounds for Roth's theorem via almost-periodicity ⋮ Sums of multiplicative characters with additive convolutions ⋮ Additive combinatorics and graph theory ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ Some Properties of Lower Level-Sets of Convolutions ⋮ The structure of approximate groups. ⋮ Convolutions of sets with bounded VC-dimension are uniformly continuous ⋮ A question of Bukh on sums of dilates ⋮ Higher moments of convolutions ⋮ Long arithmetic progressions in \(A+A+A\) with \(A\) a prime subset ⋮ Quantitative structure of stable sets in finite abelian groups ⋮ The Kelley-Meka bounds for sets free of three-term arithmetic progressions ⋮ A quantitative version of the non-Abelian idempotent theorem ⋮ Structure of Protocols for XOR Functions ⋮ On Roth's theorem on progressions ⋮ Growth and expansion in algebraic groups over finite fields ⋮ Long regularly-spaced and convex sequences in dense sets of integers ⋮ The Erdős–Moser Sum-free Set Problem ⋮ The structure theory of set addition revisited ⋮ Sumsets of dense sets and sparse sets ⋮ Arithmetic Progressions in Sumsets and Lp-Almost-Periodicity ⋮ Roth's theorem in many variables ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ Noncommutative sets of small doubling ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Extractors in Paley graphs: a random model ⋮ ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING ⋮ Exponential sum estimates over prime fields ⋮ Bounds in Cohen's idempotent theorem ⋮ Optimality of linear sketching under modular updates ⋮ Additive energy of regular measures in one and higher dimensions, and the fractal uncertainty principle ⋮ Coset decision trees and the Fourier algebra ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ On finite sets of small tripling or small alternation in arbitrary groups ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity ⋮ Growth in groups: ideas and perspectives ⋮ New bounds on cap sets
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
This page was built for publication: A probabilistic technique for finding almost-periods of convolutions