Show simple item record

Files in this item

Thumbnail
Name:
Rousseau_2023_ETDS_Orbits_closeness_CC.pdf
Size:
266.4Kb
Format:
PDF
View/Open

Orbits closeness for slowly mixing dynamical systems

Item metadata

dc.contributor.authorRousseau, Jerome
dc.contributor.authorTodd, Mike
dc.date.accessioned2023-07-24T16:30:03Z
dc.date.available2023-07-24T16:30:03Z
dc.date.issued2023-07-24
dc.identifier.citationRousseau , J & Todd , M 2023 , ' Orbits closeness for slowly mixing dynamical systems ' , Ergodic Theory and Dynamical Systems , vol. FirstView . https://doi.org/10.1017/etds.2023.50en
dc.identifier.issn0143-3857
dc.identifier.otherPURE: 266825094
dc.identifier.otherPURE UUID: 6a53cccc-6cf1-4025-b823-b0ad1a467f92
dc.identifier.otherORCID: /0000-0002-0042-0713/work/139553708
dc.identifier.otherScopus: 85166568041
dc.identifier.urihttp://hdl.handle.net/10023/28017
dc.descriptionBoth authors were partially supported by FCT projects PTDC/MAT-PUR/28177/2017 and by CMUP (UIDB/00144/2020), which is funded by FCT with national (MCTES) and European structural funds through the programs FEDER, under the partnership agreement PT2020. JR was also partially supported by CNPq and PTDC/MATPUR/4048/2021, and with national funds.en
dc.description.abstractGiven 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.
dc.format.extent17
dc.language.isoeng
dc.relation.ispartofErgodic Theory and Dynamical Systemsen
dc.rightsCopyright © The Author(s), 2023. Published by Cambridge University Press. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.en
dc.subjectShortest distanceen
dc.subjectLongest common substringen
dc.subjectCorrelation dimensionen
dc.subjectInducing schemesen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subjectMCPen
dc.subject.lccQAen
dc.titleOrbits closeness for slowly mixing dynamical systemsen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. School of Mathematics and Statisticsen
dc.identifier.doihttps://doi.org/10.1017/etds.2023.50
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.