Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Single and multiple recurrence along non-polynomial sequences
 
research article

Single and multiple recurrence along non-polynomial sequences

Bergelson, Vitaly
•
Moreira, Joel
•
Richter, Florian Karl  
July 15, 2020
Advances in Mathematics

We establish new recurrence and multiple recurrence results for a rather large family of non-polynomial functions which contains tempered functions and (non-polynomial) functions from a Hardy field with polynomial growth. In particular, we show that, somewhat surprisingly (and in the contrast to the multiple recurrence along polynomials), the sets of return times along functions from are thick, i.e., contain arbitrarily long intervals. A major component of our paper is a new result about equidistribution of sparse sequences on nilmanifolds, whose proof borrows ideas from the work of Green and Tao [26]. Among other things, we show that for any , any invertible probability measure preserving system , any with , and any , the sets of returns

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.aim.2020.107146
ArXiv ID

1711.05729

Author(s)
Bergelson, Vitaly
Moreira, Joel
Richter, Florian Karl  
Date Issued

2020-07-15

Published in
Advances in Mathematics
Volume

368

Article Number

107146

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
ERG  
Available on Infoscience
November 26, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/183243
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés