An elementary additive doubling inequality
classification
🧮 math.CO
keywords
doublingadditiveelementaryinequalitylargesubsetabeliancombinatorics
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.