Skip to main content
    • Aa
    • Aa

Factoring higher-dimensional shifts of finite type onto the full shift


A one-dimensional shift of finite type $(X, \mathbb Z)$ with entropy at least log n factors onto the full n-shift. The factor map is constructed by exploiting the fact that X, or a subshift of X, is conjugate to a shift of finite type in which every symbol can be followed by at least n symbols. We will investigate analogous statements for higher-dimensional shifts of finite type. We will also show that for a certain class of mixing higher-dimensional shifts of finite type, sufficient entropy implies that $(X,\mathbb Z^d )$ is finitely equivalent to a shift of finite type that maps onto the full n-shift.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Ergodic Theory and Dynamical Systems
  • ISSN: 0143-3857
  • EISSN: 1469-4417
  • URL: /core/journals/ergodic-theory-and-dynamical-systems
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 7 *
Loading metrics...

Abstract views

Total abstract views: 64 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th October 2017. This data will be updated every 24 hours.