English

Multiple ergodic averages for three polynomials and applications

Dynamical Systems 2007-08-27 v2 Combinatorics

Abstract

We find the smallest characteristic factor and a limit formula for the multiple ergodic averages associated to any family of three polynomials and polynomial families of the form {l1p,l2p,...,lkp}\{l_1p,l_2p,...,l_kp\}. We then derive several multiple recurrence results and combinatorial implications, including an answer to a question of Brown, Graham, and Landman, and a generalization of the Polynomial Szemer\'edi Theorem of Bergelson and Leibman for families of three polynomials with not necessarily zero constant term. We also simplify and generalize a recent result of Bergelson, Host, and Kra, showing that for all ϵ>0\epsilon>0 and every subset of the integers Λ\Lambda the set {nN ⁣:d(Λ(Λ+p1(n))(Λ+p2(n))(Λ+p3(n)))>(d(Λ))4ϵ} \big\{n\in\N\colon d^*\big(\Lambda\cap (\Lambda+p_1(n))\cap (\Lambda+p_2(n))\cap (\Lambda+ p_3(n))\big)>(d^*(\Lambda))^4-\epsilon\big\} has bounded gaps for "most" choices of integer polynomials p1,p2,p3p_1,p_2,p_3.

Keywords

Cite

@article{arxiv.math/0606567,
  title  = {Multiple ergodic averages for three polynomials and applications},
  author = {Nikos Frantzikinakis},
  journal= {arXiv preprint arXiv:math/0606567},
  year   = {2007}
}

Comments

47 pages, Final version to appear in the Trans. Amer. Math. Soc