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.

This page was built for publication: An elementary additive doubling inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6226716)