English

Optimal lower bounds for multiple recurrence

Dynamical Systems 2019-08-06 v2 Combinatorics

Abstract

Let (X,B,μ,T)(X, \mathcal{B},\mu,T) be an ergodic measure preserving system, ABA \in \mathcal{B} and ϵ>0\epsilon>0. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap T^{-f_1(n)}A\cap T^{-f_2(n)}A\cap\ldots\cap T^{-f_k(n)}A)> \mu(A)^{k+1} - \epsilon \right\} \end{split} \end{equation*} for various families {f1,,fk}\{f_1,\dots,f_k\} of sequences fi ⁣:NNf_i\colon \mathbb{N} \to \mathbb{N}. For k3k \leq 3 and fi(n)=if(n)f_{i}(n)=i f(n), we show that SS has positive density if f(n)=q(pn)f(n)=q(p_n) where qZ[x]q \in \mathbb{Z}[x] satisfies q(1)q(1) or q(1)=0q(-1) =0 and pnp_n denotes the nn-th prime; or when ff is a certain Hardy field sequence. If TqT^q is ergodic for some qNq \in \mathbb{N}, then for all rZr \in \mathbb{Z}, SS is syndetic if f(n)=qn+rf(n) = qn + r. For fi(n)=ainf_{i}(n)=a_{i}n, where aia_{i} are distinct integers, we show that SS can be empty for k4k\geq 4, and for k=3k = 3 we found an interesting relation between the largeness of SS and the abundance of solutions to certain linear equations in sparse sets of integers. We also provide some partial results when the fif_{i} are distinct polynomials.

Keywords

Cite

@article{arxiv.1809.06912,
  title  = {Optimal lower bounds for multiple recurrence},
  author = {Sebastián Donoso and Anh N. Le and Joel Moreira and Wenbo Sun},
  journal= {arXiv preprint arXiv:1809.06912},
  year   = {2019}
}

Comments

29 pages

R2 v1 2026-06-23T04:10:41.034Z