Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-12-01T03:23:30.055Z Has data issue: false hasContentIssue false
  • English
  • Français

Linearly recurrent subshifts have a finite number of non-periodic subshift factors

Published online by Cambridge University Press:  01 August 2000

FABIEN DURAND
FABIEN DURAND
Affiliation:
Faculté de Mathématiques et d'Informatique, Université de Picardie Jules Verne, 33, rue Saint Leu, 80039 Amiens Cedex, France (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

A minimal subshift $(X,T)$ is linearly recurrent (LR) if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word, $u$, the return time to $U$, with respect to $T$, is bounded by $K|u|$. We prove that given a LR subshift $(X,T)$ the set of its non-periodic subshift factors is finite up to isomorphism. We also give a constructive characterization of these subshifts.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 20 , Issue 4 , August 2000 , pp. 1061 - 1078
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)