The Typical Approximate Structure of Sets with Bounded Sumset
From MaRDI portal
Publication:6170439
DOI10.1137/22M1511801arXiv2108.06253MaRDI QIDQ6170439
Maximilian Wötzel, Marcelo Campos, Matthew Coulson, Oriol Serra
Publication date: 10 August 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.06253
Hypergraphs (05C65) Inverse problems of additive number theory, including sumsets (11P70) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- Hypergraph containers
- A generalization of Kneser's addition theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A statistical theorem of set addition
- Sum of sets in several dimensions
- Counting sets with small sumset and applications
- Structure theorem for multiple addition and the Frobenius problem
- The structure of approximate groups.
- On the number of sets with a given doubling constant
- Abschätzung der asymptotischen Dichte von Summenmengen
- A Brunn-Minkowski inequality for the integer lattice
- On Sums of Dilates
- A Generalisation of the Theorem of Cauchy and Davenport
- Restricted Set Addition in Groups I: The Classical Setting
- On addition of two distinct sets of integers
- On addition of two distinct sets of integers
- The Typical Structure of Sets With Small Sumset
- On an almost all version of the Balog-Szemeredi-Gowers theorem
- Independent sets in hypergraphs
- Freiman's theorem in an arbitrary abelian group
- A refinement of the Cameron-Erdős conjecture
- A robust version of Freiman's 3k–4 Theorem and applications
- Restricted set addition in groups. III: Integer sumsets with generic restrictions
This page was built for publication: The Typical Approximate Structure of Sets with Bounded Sumset
