An elementary proof of Jin's theorem with a bound (Q405240)

From MaRDI portal
Revision as of 03:31, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An elementary proof of Jin's theorem with a bound
scientific article

    Statements

    An elementary proof of Jin's theorem with a bound (English)
    0 references
    0 references
    4 September 2014
    0 references
    Summary: We present a short and self-contained proof of \textit{R. Jin}'s theorem [Proc. Am. Math. Soc. 130, No. 3, 855--861 (2002; Zbl 0985.03066)] about the piecewise syndeticity of difference sets which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. An explicit bound to the number of shifts that are needed to cover a thick set is provided. Precisely, we prove the following: If \(A\) and \(B\) are sets of integers having positive upper Banach densities \(a\) and \(b\) respectively, then there exists a finite set \(F\) of cardinality at most \(1/ab\) such that \((A-B)+F\) covers arbitrarily long intervals.
    0 references
    sumsets
    0 references
    upper Banach density
    0 references
    piecewise syndetic set
    0 references
    Jin's theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references