English

Iterated differences sets, diophantine approximations and applications

Combinatorics 2024-01-09 v5 Dynamical Systems Number Theory

Abstract

Let vv be an odd real polynomial (i.e. a polynomial of the form j=1ajx2j1\sum_{j=1}^\ell a_jx^{2j-1}). We utilize sets of iterated differences to establish new results about sets of the form R(v,ϵ)={nNv(n)<ϵ}\mathcal R(v,\epsilon)=\{n\in\mathbb{N}\,|\,\|v(n)\|{<\epsilon\}} where \|\cdot\| 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.

Keywords

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

R2 v1 2026-06-23T19:03:50.512Z