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"urstenberg and B. Weiss), where a precise bound is given on the number of shifts of which are needed to cover arbitrarily large intervals.
Recommendations
Cited in
(7)- Multiplicative finite embeddability vs divisibility of ultrafilters
- High density piecewise syndeticity of sumsets
- Ultrafilters maximal for finite embeddability
- An elementary proof of Jin's theorem with a bound
- scientific article; zbMATH DE number 4126077 (Why is no real title available?)
- \(\mathcal {F}\)-finite embeddabilities of sets and ultrafilters
- The Infinitude of the Primes and Some Coloring Theorems
This page was built for publication: Embeddability properties of difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495442)