Hostname: page-component-7c8c6479df-24hb2 Total loading time: 0 Render date: 2024-03-28T10:21:05.398Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  13 May 2005

AIMEE JOHNSON
Affiliation:
Department of Mathematics and Statistics, Swarthmore College, Swarthmore, PA 19081, USA (e-mail: aimee@swarthmore.edu)
KATHLEEN MADDEN
Affiliation:
Department of Mathematics and Computer Science, Drew University, Madison, NJ 07940, USA (e-mail: kmadden@drew.edu)

Abstract

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.

Type
Research Article
Copyright
2005 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.)