An ultrafilter approach to Jin's Theorem
Combinatorics
2009-08-21 v1
Abstract
It is well known and not difficult to prove that if of integers has positive upper Banach density, the set of differences is syndetic, i.e. the length of gaps is uniformly bounded. More surprisingly, Renling Jin showed that whenever and have positive upper Banach density, then is piecewise syndetic. Jin's result follows trivially from the first statement provided that has large intersection with a shifted copy of . Of course this will not happen in general if we consider shifts by integers, but the idea can be put to work if we allow "shifts by ultrafilters". As a consequence we obtain Jin's Theorem.
Cite
@article{arxiv.0908.2872,
title = {An ultrafilter approach to Jin's Theorem},
author = {Mathias Beiglboeck},
journal= {arXiv preprint arXiv:0908.2872},
year = {2009}
}