Iterated differences sets, diophantine approximations and applications

Abstract

Let v be an odd real polynomial (i.e. a polynomial of the form Σj=1 ajx2j-1). We utilize sets of iterated differences to establish new results about sets of the form R(v,ε)=\n∈N\,|\,\|v(n)\|<ε\ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…