arXiv (All)
open access
The typical structure of sets with large sumset
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. As an application, we show that a uniformly at random chosen subset $A \subseteq \{1, \ldots, n\}$ of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Concentration inequalities for strong laws and laws of the iterated logarithm#986798
- Local large deviations for triangles in sparse random graphs#1036279
- The Exact Law of Large Numbers for Independent Random Matching#21082
- Logarithmic Large Deviations for Heavy-Tailed Randomly Stopped Sums#1061730
- A sharp almost sure upper bound for partial sums of random multiplicative functions#1156438
Record · ID 1142701
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive