Linearly recurrent subshifts have a finite number of non-periodic subshift factors
| dc.creator | Durand, Fabien | |
| dc.date | 2008-07-28 | |
| dc.date.accessioned | 2026-07-07T09:53:17Z | |
| dc.date.available | 2026-07-07T09:53:17Z | |
| dc.description | A minimal subshift $(X,T)$ is linearly recurrent 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 linearly recurrent 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. | |
| dc.identifier | https://arxiv.org/abs/0807.4430 | |
| dc.identifier | http://arxiv.org/abs/0807.4430 | |
| dc.identifier | Ergodic Theory and Dynamical Systems 20 (2000) 1061-1078 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/165901 | |
| dc.subject | Dynamical Systems | |
| dc.subject | 37B10 | |
| dc.title | Linearly recurrent subshifts have a finite number of non-periodic subshift factors | |
| dc.type | text |