An elementary additive doubling inequality
Abstract
We prove an elementary additive combinatorics inequality, which says that if A is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.
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.