Paper detail

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

A set $R\subset \mathbb{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\in\mathbb{N}: \frac{\boldsymbolφ(n)}{n}<x\}$, where $x\in[0,1]$ and $\boldsymbolφ$ is Euler&#39;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 $\overline{d}(R)>0$, then the following are equivalent: (a) $R$ is divisible, i.e. $\overline{d}(R\cap u \mathbb{N})>0$ for all $u\in\mathbb{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\subset\mathbb{N}$ with $\overline{d}(E)>0$ and any polynomials $p_i\in\mathbb{Q}[t]$,$i=1,\ldots,\ell$, which satisfy $p_i(\mathbb{Z})\subset\mathbb{Z}$ and $p_i(0)=0$ for all $i\in\{1,\ldots,\ell\}$, there exists $β>0$ such that the set $$\{n\in R:\overline{d}( E\cap (E-p_1(n))\cap\ldots\cap(E-p_\ell(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 $\mathcal{A}$ is a finite alphabet, $η\in\mathcal{A}^\mathbb{N}$ is rationally almost periodic, $S$ denotes the left-shift on $\mathcal{A}^\mathbb{Z}$ and $$X:=\{y\in \mathcal{A}^\mathbb{Z} : \text{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.