Counting sets with small sumset and applications
From MaRDI portal
Publication:1701347
DOI10.1007/s00493-015-3129-4zbMath1399.11168arXiv1305.3079MaRDI QIDQ1701347
Publication date: 22 February 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.3079
60C05: Combinatorial probability
05A16: Asymptotic enumeration
11P70: Inverse problems of additive number theory, including sumsets
Related Items
Sum-Free Sets of Integers with a Forbidden Sum, On the Chromatic Number of Random Cayley Graphs, On the subgraphs of Cayley sum graphs, The Typical Approximate Structure of Sets with Bounded Sumset, On the structure of large sum-free sets of integers, A Cheeger type inequality in finite Cayley sum graphs, Progress on local properties problems of difference sets, On the number of sets with a given doubling constant, One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on $\mathbb{F}_2^n$
Cites Work
- Unnamed Item
- Compressions and isoperimetric inequalities
- Multilinear exponential sums in prime fields under optimal entropy condition on the sources
- A quantified version of Bourgain's sum-product estimate in \(\mathbb F_{p}\) for subsets of incomparable sizes
- Arithmetical progressions and the number of sums
- Rectification principles in additive number theory
- A polynomial bound in Freiman's theorem.
- The cardinality of restricted sumsets.
- Counting sets with small sumset, and the clique number of random Cayley graphs
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Random regular graphs of high degree
- Counting sumsets and sum-free sets modulo a prime
- An arithmetic regularity lemma, associated counting lemma, and applications
- SETS WITH SMALL SUMSET AND RECTIFICATION
- A Generalisation of the Theorem of Cauchy and Davenport
- Discrete Isoperimetric Problems
- The structure theory of set addition revisited
- A refinement of the Cameron-Erdős conjecture
