Counting sets with small sumset and applications
We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a factor of $2^{o(k)} N^{o(1)}$ for most $N$ and $k$....
Main Authors: | Green, B, Morris, R |
---|---|
Format: | Journal article |
Published: |
2013
|
Similar Items
-
Sets with small sumset and rectification
by: Green, B, et al.
Published: (2004) -
Counting sets with small sumset, and the clique number of random Cayley
graphs
by: Green, B
Published: (2003) -
Sumsets and entropy revisited
by: Green, B, et al.
Published: (2024) -
Additive structures in sumsets
by: Sanders, T
Published: (2008) -
Bohr sets in sumsets II: countable abelian groups
by: John T. Griesmer, et al.
Published: (2023-01-01)