Iterated differences sets, diophantine approximations and applications
Combinatorics
2024-01-09 v5 Dynamical Systems
Number Theory
Abstract
Let be an odd real polynomial (i.e. a polynomial of the form ). We utilize sets of iterated differences to establish new results about sets of the form where denotes the distance to the closest integer. We then apply the new diophantine results to obtain applications to ergodic theory and combinatorics. In particular, we obtain a new characterization of weakly mixing systems as well as a new variant of Furstenberg-S\'ark\"ozy theorem.
Cite
@article{arxiv.2010.02325,
title = {Iterated differences sets, diophantine approximations and applications},
author = {Vitaly Bergelson and Rigoberto Zelada},
journal= {arXiv preprint arXiv:2010.02325},
year = {2024}
}
Comments
43 pages, referees' comments included, minor errors in the proofs of Theorem 4.1 and Lemma 5.3 were corrected