Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-16T17:02:02.280Z Has data issue: false hasContentIssue false

Resolving maps which commute with a power of the shift

Published online by Cambridge University Press:  19 September 2008

Paul Trow
Affiliation:
Department of Mathematics, Northwestern University, Evanston, Illinois 60201, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we prove an extension of a theorem of Marcus, which says that every subshift of finite type of entropy log n, n an integer, factors onto the full n-shift. Let p(x) be a monic polynomial, irreducible over ℚ, whose coefficients (except for the leading coefficient) are non-positive integers. Suppose C(λ) is the companion matrix of p(x), where λ is the largest real root of p(x) (λ exists, by the Perron-Frobenius theorem). Then for any aperiodic, non-negative, integral matrix A, with Perron value λ, we give necessary and sufficient conditions for the existence of a positive integer n and a right-closing map f: ΣA→ΣC(λ) satisfying fσn = σnf (where σ is the shift map).

Type
Research Article
Copyright
Copyright © Cambridge University Press 1986

References

REFERENCES

[1]Adler, R. & Marcus, B.. Topological Entropy and Equivalence of Dynamical Systems. Memoirs Amer. Math. Soc. 219 (1979).Google Scholar
[2]Boyle, M.. Lower entropy factors of sofic systems. Ergod. Th. Dynam. Sys. 4 (1984), 541557.Google Scholar
[3]Kitchens, B.. Ph.D. Thesis, University of North Carolina, Chapel Hill (1981).Google Scholar
[4]Marcus, B.. Factors and extensions of full shifts. Monatsh. Math. 88 (1979), 239247.CrossRefGoogle Scholar
[5]Williams, R. F.. Classification of shifts of finite type. Annals of Math. 98 (1973), 120153.CrossRefGoogle Scholar