Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T00:52:02.989Z Has data issue: false hasContentIssue false
  • English
  • Français

Eventual factor maps and compositions of closing maps

Published online by Cambridge University Press:  19 September 2008

Bruce Kitchens ,
Brian Marcus  and
Paul Trow
Bruce Kitchens
Affiliation:
IBM Research, T.J. Watson Research Center, Yorktown Heights, New York 10598, USA
Brian Marcus
Affiliation:
IBM Research, Almaden Research Center, 650 Harry Road, San Jose, California 95120, USA
Paul Trow
Affiliation:
Mathematics Department, University of California Berkeley, Berkeley, California 94720, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove some results related to the question of the existence of factor maps and eventual factor maps between shifts of finite type. Our main result is that if A and B are integral eventually positive (IEP) matrices, and A eventually factors finite-to-one onto B, then there exists an IEP matrix C such that A eventually factors onto C by left closing maps and C eventually factors onto B by right closing maps. This answers the question of the existence of finite-to-one eventual factor maps when the spectrum of A is simple. As a corollary, if in addition to the above hypothesis, χ*A=χ*B, (where χ*A is the characteristic polynomial of A modulo x), then A is shift equivalent to B.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 11 , Issue 1 , March 1991 , pp. 85 - 113
Copyright
Copyright © Cambridge University Press 1991

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

REFERENCES

[AM]Adler, R. & Marcus, B.. Topological entropy and equivalence of dynamical systems. Memoirs Amer. Math. Soc. 219 (1979).Google Scholar
[BM]BirkhofI, G. & MacLane, S.. Algebra. Macmillan: New York, 1967.Google Scholar
[B]Boyle, M.. Lower entropy factors of sofic systems. Ergod. Th. & Dynam. Sys. 4 (1984), 541–557.Google Scholar
[BF]Bowen, R. & Franks, J., Homology for zero-dimensional nonwandering sets. Ann. Math. 106 (1977), 73–92.Google Scholar
[BMT]Boyle, M., Marcus, B. & Trow, P.. Resolving maps and the dimension group for shifts of finite type. Memoirs Amer. Math. Soc. 377 (1987).Google Scholar
[CP1]Coven, E. & Paul, M.. Endomorphisms of irreducible shifts of finite type. Math Systems Th. 8 (1974), 167–175.CrossRefGoogle Scholar
[CP2]Coven, E. & Paul, M.. Finite procedures for sofic systems. Monats. fur Math. 83 (1977), 265–278.Google Scholar
[CP3]Coven, E. & Paul, M.. Sofic systems. Israel J. Math. 20 (1975), 165–177.CrossRefGoogle Scholar
[F]Franks, J.. Flow equivalence of subshifts of finite type. Ergod. Th. & Dynam. Sys. 4 (1984), 53–66.Google Scholar
[G]Gantmacher, F.. Applications of the Theory of Matrices, Vol. 2. Interscience: New York, 1959.Google Scholar
[H]Handelman, D.. Positive matrices and dimension groups affiliated to C*-algebras and topological Markov chains. J. Operator Theory 6 (1981), 55–74.Google Scholar
[KM]Karabed, R. & Marcus, B.. Sliding block coding for input-restricted channels. I.E.E.E.-Information Th. 34 (1988), 2–26.Google Scholar
[Ki1]Kitchens, B.. An invariant for continuous factors of Markov shifts. Proc. Amer. Math. Soc. 83 (1981), 825–828.CrossRefGoogle Scholar
[Ki2]Kitchens, B.. PhD dissertation. University of North Carolina (1981).Google Scholar
[Kr]Krieger, W.. On dimension functions and topological Markov chains. Invent. Math. 56 (1980), 239–250.Google Scholar
[KR1]Kim, K. H. & Roush, F., Simple spectrum decidability of epimorphisms of dimension group and certain modules. Preprint.Google Scholar
[KR2]Kim, K. H. & Roush, F.. Some results on decidability of shift equivalence. J. Combinatorics, Info. Sys. Sci. 4 (1979), 123–146.Google Scholar
[M]Marcus, B.. Factors and extensions of full shifts. Monats. fur Math. 88 (1979), 239–247.Google Scholar
[N1]Nasu, M.. Uniformly finite-to-one and onto global maps of homomorphisms between strongly connected graphs. Discrete Math. 39 (1982), 171–197.Google Scholar
[N2]Nasu, M.. Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Th. & Dynam. Sys. 3 (1983), 387–413.Google Scholar
[N3]Nasu, M.. Topological conjugacy for sofic systems and extensions of automorphisms of finite subsystems of topological Markov shifts. Dynamical Systems, Proceedings, University of Maryland 1986–87, ed., Alexander, J. C., Springer Lecture Notes in Mathematics 1342, Springer-Verlag: Berlin-Heidelberg, 1988.Google Scholar
[P]Parry, W.. Intrinsic Markov chains. Trans. Amer. Math. Soc. 112 (1964), 55–66.Google Scholar
[T]Trow, P.. Resolving maps which commute with a power of the shift. Ergod. Th. & Dynam. Sys. 6 (1986), 281–293.CrossRefGoogle Scholar
[Wa]Walters, P.. An Introduction to Ergodic Theory. Graduate Texts in Mathematics, Vol. 79. Springer-Verlag: New York, 1981.Google Scholar
[Wi]Williams, R.. Classification of shifts of finite type. Ann. Math. 98 (1973), 120–153;Google Scholar
Errata. Ann. Math. 99 (1974), 380–381.Google Scholar