Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T04:55:19.440Z Has data issue: false hasContentIssue false
  • English
  • Français

Regular isomorphism of Markov chains is almost topological

Published online by Cambridge University Press:  19 September 2008

Mike Boyle  and
Selim Tuncel
Mike Boyle
Affiliation:
Department of Mathematics, University of Maryland, College Park, MD 20742, USA
Selim Tuncel
Affiliation:
Department of Mathematics, University of Washington, Seattle, WA 98195, 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.

Two Markov chains are regularly isomorphic if and only if they have a common Markov extension by right closing block codes of degree one. A certain ideal class in the integral group ring of the ratio group associated to a Markov chain is a new invariant of regular isomorphism and some other coding relations.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 10 , Issue 1 , March 1990 , pp. 89 - 100
Copyright
Copyright © Cambridge University Press 1990

References

REFERENCES

[1]Adler, R. L. & Marcus, B.. Topological entropy and equivalence of dynamical systems. Mem. Amer. Math. Soc. 219 (1979).Google Scholar
[2]Boyle, M., Kitchens, B. & Marcus, B.. A note on minimal covers for sofic systems. Proc. Amer. Math. Soc. 95 (1985), 403–411.CrossRefGoogle Scholar
[3]Boyle, M., Marcus, B. & Trow, P.. Resolving maps and the dimension group for shifts of finite type. Mem. Amer. Math. Soc. 377 (1987).Google Scholar
[4]Boyle, M. & Tuncel, S.. Infinite-to-one codes and Markov measures. Trans. Amer. Math. Soc. 285 (1984), 657–684.CrossRefGoogle Scholar
[5]Fellgett, R. & Parry, W.. Endomorphisms of a Lebesgue space II. Bull. London Math. Soc. 7 (1975), 151–158.CrossRefGoogle Scholar
[6]Kitchens, B.. Ph.D. thesis, University of North Carolina, Chapel Hill, 1981.Google Scholar
[7]Krieger, W.. On finitary isomorphisms of Markov shifts that have finite expected coding time. Z. Wahrscheinlichkeitstheorie 65 (1983), 323–328.CrossRefGoogle Scholar
[8]Parry, W.. Endomorphisms of a Lebesgue space III. Israel J. Math. 21 (1975), 167–172.CrossRefGoogle Scholar
[9]Parry, W. & Schmidt, K.. Natural coefficients and invariants for Markov shifts. Invent. Math. 76 (1984), 15–32.CrossRefGoogle Scholar
[10]Parry, W. & Tuncel, S.. On the classification of Markov chains by finite equivalence. Ergod. Th. & Dynam. Sys. 1 (1981), 303–335.CrossRefGoogle Scholar
[11]Parry, W. & Tuncel, S.. On the stochastic and topological structure of Markov chains. Bull. London Math. Soc. 14 (1982), 16–27.CrossRefGoogle Scholar
[12]Parry, W. & Tuncel, S.. Classification Problems in Ergodic Theory. London Math. Soc. Lecture Notes 67, Cambridge University Press, Cambridge, 1982.CrossRefGoogle Scholar
[13]Rokhlin, V. A.. On the fundamental ideas of measure theory. Transl. Amer. Math. Soc. (Series 1) 71 (1952).Google Scholar
[14]Trow, P.. Resolving maps which commute with a power of the shift. Ergod. Th. & Dynam. Sys. 6 (1986), 281–293.CrossRefGoogle Scholar
[15]Tuncel, S.. Conditional pressure and coding. Israel J. Math. 39 (1981), 101–112.CrossRefGoogle Scholar
[16]Tuncel, S.. A dimension, dimension modules, and Markov chains. Proc. London Math. Soc. 46 (1983), 100–116.CrossRefGoogle Scholar
[17]Walters, P.. An Introduction to Ergodic Theory. Grad. Texts in Math. 79, Springer: New York, 1982.CrossRefGoogle Scholar
[18]Ashley, J.. Bounded-to-1 factors of an aperiodic subshift of finite type are 1-to-l almost everywhere factors also, Ergod. Th. & Dynam. Sys. to appear.Google Scholar