Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics
Abstract
A set R⊂ N is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers, the set of abundant numbers, or sets of the form x:=\n∈N: (n)n<x\, where x∈[0,1] and is Euler's totient function. We investigate the combinatorial and dynamical properties of rational sets and obtain new results in ergodic Ramsey theory. We show that if R is a rational set with d(R)>0, then the following are equivalent: (a) R is divisible, i.e. d(R u N)>0 for all u∈N. (b) R is an averaging set of polynomial single recurrence. (c) R is an averaging set of polynomial multiple recurrence. As an application, we show that if R is rational and divisible, then for any set E⊂N with d(E)>0 and any polynomials pi∈Q[t],i=1,…,, which satisfy pi(Z)⊂Z and pi(0)=0 for all i∈\1,…,\, there exists β>0 such that the set \n∈ R:d( E (E-p1(n))…(E-p(n)))>β\ has positive lower density. Ramsey-theoretical applications naturally lead to problems in symbolic dynamics, which involve rationally almost periodic sequences. We prove that if A is a finite alphabet, η∈AN is rationally almost periodic, S denotes the left-shift on AZ and X:=\y∈ AZ : each finite word appearing in y appears in η\, then η is a generic point for an S-invariant probability measure on X such that (X,,S) is ergodic and has rational discrete spectrum.
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.