Embeddability Properties of Difference Sets
arXiv:1201.5865
Abstract
By using nonstandard analysis, we prove embeddability properties of difference sets of sets of integers. (A set is "embeddable" into if every finite configuration of has shifted copies in .) As corollaries of our main theorem, we obtain improvements of results by I.Z. Ruzsa about intersections of difference sets, and of Jin's theorem (as refined by V. Bergelson, H. Fürstenberg and B. Weiss), where a precise bound is given on the number of shifts of which are needed to cover arbitrarily large intervals.
Revised in a few parts