On the Bogolyubov-Ruzsa lemma

From MaRDI portal
Publication:1951735

DOI10.2140/apde.2012.5.627zbMath1320.11009arXiv1011.0107OpenAlexW2044472296WikidataQ124817981 ScholiaQ124817981MaRDI QIDQ1951735

Tom Sanders

Publication date: 24 May 2013

Published in: Analysis \& PDE (Search for Journal in Brave)

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




Related Items

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic boundsFrom Affine to Two-Source Extractors via Approximate DualityFreiman's theorem in an arbitrary nilpotent groupCharacter sums estimates and an application to a problem of BalogThe structure of approximate groups.Convolutions of sets with bounded VC-dimension are uniformly continuousAdditive energy and the Hausdorff dimension of the exceptional set in metric pair correlation problemsSums of transcendental dilatesCharacterisation of Meyer sets via the Freiman-Ruzsa theoremHigher moments of convolutionsInverse theorem for certain directional Gowers uniformity normsOn the size of \(A+ \lambda A\) for algebraic \(\lambda \)Approximate subgroups of residually nilpotent groupsA linear bound on the dimension in Green-Ruzsa's theoremSmall sum sets, subcriticality structureApproximate subgroups with bounded VC-dimensionQuantitative structure of stable sets in finite abelian groupsThe Kelley-Meka bounds for sets free of three-term arithmetic progressionsStructure of Protocols for XOR FunctionsA bilinear version of Bogolyubov’s theoremA bilinear Bogolyubov theoremGrowth and expansion in algebraic groups over finite fieldsOn percolation and ‐hardnessSums of Linear Transformations in Higher DimensionsNon-Malleable Codes from Additive CombinatoricsOn sumsets of subsets of squaresQuery complexity and the polynomial Freiman-Ruzsa conjectureOn some applications of GCD sums to arithmetic combinatoricsLarge values of the additive energy in andArithmetic Progressions in Sumsets and Lp-Almost-PeriodicityRoth's theorem in many variablesUnnamed ItemADDITIVE DIMENSION AND A THEOREM OF SANDERSROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETSFour-state non-malleable codes with explicit constant rateOptimal Computational Split-state Non-malleable CodesPolynomial bound for the partition rank vs the analytic rank of tensorsFinite field models in arithmetic combinatorics -- ten years onA model-theoretic note on the Freiman-Ruzsa theoremA note on the bilinear Bogolyubov theorem: Transverse and bilinear setsPolylogarithmic bounds in the nilpotent Freiman theoremARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLINGEnergies and structure of additive setsOn the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier supportGCD sums and sum-product estimatesUnnamed ItemDifference sets are not multiplicatively closedLINEAR AND QUADRATIC UNIFORMITY OF THE MÖBIUS FUNCTION OVERAdditive energy of regular measures in one and higher dimensions, and the fractal uncertainty principleBoolean functions with small spectral norm, revisitedCoset 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 groupsGood Bounds in Certain Systems of True Complexity OneAn Additive Combinatorics Approach Relating Rank to Communication ComplexityQuantitative structure of stable sets in arbitrary finite groupsThe Uniformity Conjecture in Additive CombinatoricsGrowth in groups: ideas and perspectives