An elementary proof of Jin's theorem with a bound
From MaRDI portal
Publication:405240
zbMATH Open1301.11009arXiv1209.5575MaRDI QIDQ405240FDOQ405240
Authors: Mauro Di Nasso
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1209.5575
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Other combinatorial number theory (11B75) Density, gaps, topology (11B05) Additive bases, including sumsets (11B13)
Cites Work
- Title not available (Why is that?)
- Additive combinatorics
- Title not available (Why is that?)
- Sumset phenomenon in countable amenable groups
- An ultrafilter approach to Jin's theorem
- The sumset phenomenon
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reconstruction of Interval Graphs
- Embeddability properties of difference sets
- On difference-sequences
- On iterated difference sets in groups
Cited In (7)
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)