Dense difference sets and their combinatorial structure

Abstract

We show that if a set B of positive integers has positive upper density, then its difference set D(B) has extremely rich combinatorial structure, both additively and multiplicatively. If on the other hand only the density of D(B) rather than B is assumed to be positive, one is not guaranteed any multiplicative structure at all and is guaranteed only a modest amount of additive structure.