Sumsets of random sets
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916059228930048 |
|---|---|
| author | Nenadov, Rajko Verlinde, Lander |
| author_facet | Nenadov, Rajko Verlinde, Lander |
| contents | Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container argument. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29680 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sumsets of random sets Nenadov, Rajko Verlinde, Lander Combinatorics Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container argument. |
| title | Sumsets of random sets |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.29680 |