English

Sumsets of random sets

Combinatorics 2026-05-29 v1

Abstract

Given mNm \in \mathbb{N} and a pp-random subset ANA \subseteq \mathbb{N}, we asymptotically determine logPr(N(A+A)m)\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m) for pp above the threshold for this property. The proof is based on a bespoke container argument.

Keywords

Cite

@article{arxiv.2605.29680,
  title  = {Sumsets of random sets},
  author = {Rajko Nenadov and Lander Verlinde},
  journal= {arXiv preprint arXiv:2605.29680},
  year   = {2026}
}

Comments

15 pages