Hostname: page-component-8448b6f56d-tj2md Total loading time: 0 Render date: 2024-04-24T09:42:49.997Z Has data issue: false hasContentIssue false
  • English
  • Français

On the automorphism groups of multidimensional shifts of finite type

Published online by Cambridge University Press:  24 November 2009

MICHAEL HOCHMAN
MICHAEL HOCHMAN*
Affiliation:
Fine Hall, Washington Rd., Princeton, NJ 08544, USA (email: hochman@princeton.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate algebraic properties of the automorphism group of multidimensional shifts of finite type (SFTs). We show that positive entropy implies that the automorphism group contains every finite group and, together with transitivity, implies that the center of the automorphism group is trivial (i.e. consists only of the shift action). We also show that positive entropy and dense minimal points (in particular, dense periodic points) imply that the automorphism group of X contains a copy of the automorphism group of the one-dimensional full shift, and hence contains non-trivial elements of infinite order. On the other hand we construct a mixing, positive-entropy SFT whose automorphism group is, modulo the shift action, a union of finite groups.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 30 , Issue 3 , June 2010 , pp. 809 - 840
Copyright
Copyright © Cambridge University Press 2009

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.)

References

[1]Balister, P., Bollobás, B. and Quas, A.. Entropy along convex shapes, random tilings and shifts of finite type. Illinois J. Math. 46(3) (2002), 781–795.CrossRefGoogle Scholar
[2]Boyle, M., Lind, D. and Rudolph, D.. The automorphism group of a shift of finite type. Trans. Amer. Math. Soc. 306(1) (1988), 71–114.CrossRefGoogle Scholar
[3]Hedlund, G. A.. Endormorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3 (1969), 320–375.CrossRefGoogle Scholar
[4]Hochman, M.. On the dynamics and recursive properties of multidimensional symbolic systems. Invent. Math. 176(1) (2009), 131–167.CrossRefGoogle Scholar
[5]Hochman, M. and Meyerovitch, T.. A characterization of the entropies of multidimensional shifts of finite type. Ann. of Math. (2) (2007) to appear.Google Scholar
[6]Kim, K. H. and Roush, F. W.. On the automorphism groups of subshifts. Pure Math. Appl. Ser. B 1(4) (1990), 203–230 (1991)Google Scholar
[7]Kitchens, B. P.. Symbolic dynamics, one-sided, two-sided and countable state Markov shifts. Universitext. Springer, Berlin, 1998.Google Scholar
[8]Lind, D. and Marcus, B.. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.CrossRefGoogle Scholar
[9]Robinson, R. M.. Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12 (1971), 177–209.CrossRefGoogle Scholar
[10]Ryan, J. P.. The shift and commutativity. Math. Systems Theory 6 (1972), 82–85.CrossRefGoogle Scholar
[11]Simpson, S.. Medvedev degrees of 2-dimensional subshifts of finite type. Ergod. Th. & Dynam. Sys. (2007) to appear.Google Scholar
[12]Ward, T.. Automorphisms of Zd-subshifts of finite type. Indag. Math. (N.S.) 5(4) (1994), 495–504.CrossRefGoogle Scholar