Hostname: page-component-6766d58669-zlvph Total loading time: 0 Render date: 2026-05-17T16:42:52.394Z Has data issue: false hasContentIssue false

Orbits closeness for slowly mixing dynamical systems

Published online by Cambridge University Press:  24 July 2023

JÉRÔME ROUSSEAU
Affiliation:
CREC, Académie Militaire de St Cyr Coëtquidan, 56381 GUER Cedex, France IRMAR, CNRS UMR 6625, Université de Rennes 1, Rennes 35042, France Departamento de Matemática, Universidade Federal da Bahia, Avenida Ademar de Barros s/n, Salvador 40170-110, BA, Brazil (e-mail: jerome.rousseau@ufba.br)
MIKE TODD*
Affiliation:
Mathematical Institute, University of St Andrews, North Haugh, St Andrews, KY16 9SS, UK
Rights & Permissions [Opens in a new window]

Abstract

Given a dynamical system, we prove that the shortest distance between two n-orbits scales like n to a power even when the system has slow mixing properties, thus building and improving on results of Barros, Liao and the first author [On the shortest distance between orbits and the longest common substring problem. Adv. Math. 344 (2019), 311–339]. We also extend these results to flows. Finally, we give an example for which the shortest distance between two orbits has no scaling limit.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press