On the Structure of Sets of Large Doubling
Abstract
We investigate the structure of finite sets A ⊂eq where |A+A| is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive combinatorics. In particular, we answer a question along these lines posed by O'Bryant. Our construction also answers several questions about the nature of finite unions of B2[g] and B2[g] sets, and enables us to construct a (4) set which does not contain large B2[g] or B2[g] sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.