A statistical theorem of set addition

From MaRDI portal
Publication:1340134

DOI10.1007/BF01212974zbMath0812.11017OpenAlexW2091329824WikidataQ100442430 ScholiaQ100442430MaRDI QIDQ1340134

Endre Szemerédi, Antal Balog

Publication date: 15 May 1995

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212974




Related Items

On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product TheoremRestriction and Kakeya phenomena for finite fieldsFrom Affine to Two-Source Extractors via Approximate DualityProduct set estimates for non-commutative groupsThe Elekes-Szabó problem and the uniformity conjectureGeneralizations of Fourier analysis, and how to apply themThe structure of sets with few sums along a graphNon-commutative methods in additive combinatorics and number theoryBlocking visibility for points in general positionNew bounds in Balog-Szemerédi-Gowers theoremEquivalence of polynomial conjectures in additive combinatoricsChowla's cosine problemA question of Bukh on sums of dilatesHigher moments of convolutionsInverse theorem for certain directional Gowers uniformity normsExplicit RIP matrices: an updateThe Typical Approximate Structure of Sets with Bounded SumsetAdditive structure in convex translatesNEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FORWorking session: Thin groups and super-approximation. Abstracts from the working session held October 10--15, 2021 (hybrid meeting)On sets with small doubling propertyA bilinear version of Bogolyubov’s theoremOn Quasi-Energy-Spectra, Pair Correlations of Sequences and Additive CombinatoricsAn inverse theorem for the Gowers \(U^{s+1}[N\)-norm] ⋮ A combinatorial problem on polynomials and rational functionsWorking session: Additive combinatorics, entropy, and fractal geometry. Abstracts from the working session held October 8--13, 2017Arithmetic combinatorics on Vinogradov systemsNon-Malleable Codes from Additive CombinatoricsExpansion in finite simple groups of Lie type.Differences of subgroups in subgroupsOn a problem of Duke-Erdős-Rödl on cycle-connected subgraphsOn the structure of the spectrum of small setsTight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.The structure theory of set addition revisitedSums and products along sparse graphsLimitation on the Rate of Families of Locally Testable CodesSumset and Inverse Sumset Theory for Shannon EntropyDifference CoversOptimal Computational Split-state Non-malleable CodesOrder-preserving Freiman isomorphismsDependent random choiceA NOTE ON THE FREIMAN AND BALOG–SZEMERÉDI–GOWERS THEOREMS IN FINITE FIELDSPair correlation of sequences with maximal additive energySum-avoiding sets in groupsOn linear combinatorics. I: Concurrency---an algebraic approachLocally random groupsOn a question of Erdős and MoserFrom harmonic analysis to arithmetic combinatoricsGrowth in groups: ideas and perspectivesOn the combinatorics of projective mappings




This page was built for publication: A statistical theorem of set addition