An Elementary Proof of Jin's Theorem with a Bound
Combinatorics
2012-09-26 v1
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.
Cite
@article{arxiv.1209.5575,
title = {An Elementary Proof of Jin's Theorem with a Bound},
author = {Mauro Di Nasso},
journal= {arXiv preprint arXiv:1209.5575},
year = {2012}
}