Sumsets of random sets
Abstract
Given m ∈ N and a p-random subset A ⊂eq N, we asymptotically determine (|N (A + A)| m) for p above the threshold for this property. The proof is based on a bespoke container argument.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.