On an almost all version of the Balog-Szemeredi-Gowers theorem
From MaRDI portal
Publication:5211011
DOI10.19086/da.9095zbMath1473.11024arXiv1811.10707OpenAlexW2974183384MaRDI QIDQ5211011
Publication date: 17 January 2020
Published in: discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10707
Additive bases, including sumsets (11B13) Abelian groups (20K99) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
A Kneser-Type Theorem for Restricted Sumsets, A Freiman-type Theorem for restricted sumsets, The Typical Approximate Structure of Sets with Bounded Sumset, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Cites Work
- Unnamed Item
- When the sieve works
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- A new proof of the graph removal lemma
- A combinatorial proof of the removal lemma for groups
- Generalized arithmetical progressions and sumsets
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A Note on Elkin’s Improvement of Behrend’s Construction
- Convolutions of sets with bounded VC-dimension are uniformly continuous
- On addition of two distinct sets of integers
- Freiman's theorem in an arbitrary abelian group
- A robust version of Freiman's 3k–4 Theorem and applications
