An elementary proof of Jin's theorem with a bound
From MaRDI portal
(Redirected from Publication:405240)
Abstract: We present a short proof of Jin's theorem which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. The given proof provides the explicit bound 1/c where c=BD(A)*BD(B) to the number of shifts of A+B that are needed to cover a thick set.
Recommendations
Cites work
- scientific article; zbMATH DE number 5130808 (Why is no real title available?)
- scientific article; zbMATH DE number 3657895 (Why is no real title available?)
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 2156415 (Why is no real title available?)
- scientific article; zbMATH DE number 5663738 (Why is no real title available?)
- Additive combinatorics
- An ultrafilter approach to Jin's theorem
- Embeddability properties of difference sets
- On difference-sequences
- On iterated difference sets in groups
- Reconstruction of Interval Graphs
- Sumset phenomenon in countable amenable groups
- The sumset phenomenon
Cited in
(7)- An ultrafilter approach to Jin's theorem
- Sumset phenomenon in locally compact topological groups
- scientific article; zbMATH DE number 3075964 (Why is no real title available?)
- Sumsets of dense sets and sparse sets
- A monad measure space for logarithmic density
- Embeddability properties of difference sets
- High density piecewise syndeticity of sumsets
This page was built for publication: An elementary proof of Jin's theorem with a bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405240)