A probabilistic technique for finding almost-periods of convolutions

From MaRDI portal
Publication:616150

DOI10.1007/s00039-010-0101-8zbMath1234.11013arXiv1003.2978OpenAlexW2161591058MaRDI 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




Related Items (38)

A note on bilinear exponential sums in prime fieldsLogarithmic bounds for Roth's theorem via almost-periodicitySums of multiplicative characters with additive convolutionsAdditive combinatorics and graph theoryFrom Affine to Two-Source Extractors via Approximate DualitySome Properties of Lower Level-Sets of ConvolutionsThe structure of approximate groups.Convolutions of sets with bounded VC-dimension are uniformly continuousA question of Bukh on sums of dilatesHigher moments of convolutionsLong arithmetic progressions in \(A+A+A\) with \(A\) a prime subsetQuantitative structure of stable sets in finite abelian groupsThe Kelley-Meka bounds for sets free of three-term arithmetic progressionsA quantitative version of the non-Abelian idempotent theoremStructure of Protocols for XOR FunctionsOn Roth's theorem on progressionsGrowth and expansion in algebraic groups over finite fieldsLong regularly-spaced and convex sequences in dense sets of integersThe Erdős–Moser Sum-free Set ProblemThe structure theory of set addition revisitedSumsets of dense sets and sparse setsArithmetic Progressions in Sumsets and Lp-Almost-PeriodicityRoth's theorem in many variablesROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETSNoncommutative sets of small doublingFinite field models in arithmetic combinatorics -- ten years onExtractors in Paley graphs: a random modelARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLINGExponential sum estimates over prime fieldsBounds in Cohen's idempotent theoremOptimality of linear sketching under modular updatesAdditive energy of regular measures in one and higher dimensions, and the fractal uncertainty principleCoset decision trees and the Fourier algebraAdditive Combinatorics: With a View Towards Computer Science and Cryptography—An ExpositionOn finite sets of small tripling or small alternation in arbitrary groupsAn Additive Combinatorics Approach Relating Rank to Communication ComplexityGrowth in groups: ideas and perspectivesNew bounds on cap sets



Cites Work


This page was built for publication: A probabilistic technique for finding almost-periods of convolutions