An elementary proof of Jin's theorem with a bound (Q405240): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1209.5575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sumset phenomenon in countable amenable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ultrafilter approach to Jin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddability Properties of Difference Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated difference sets in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sumset phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On difference-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393666 / rank
 
Normal rank

Latest revision as of 23:49, 8 July 2024

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
    0 references