Abstract
Shift equivalence is the relation between matrices A, B that matrices R, S exist with RA=BR, AS=SA, SR=An, RS=Bn, n∈Z. We prove decidability in all cases of shift equivalence over Z + reducing it to congruences, inequalities, and determinant conditions on a C such that R0C is a desired Z shift equivalence, where R0 is a given shift equivalence over Q. Congruences are only modulo primes occurring to bounded powers in the determinant. We find generators for a group in which other primes are invertible, and for cosets of this group and reduce modulo some m.
Partially supported by NSF DMS 8521533
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Adler, D. Coppersmith and M. Hassner, Algorithms for sliding block codes, IEEE Trans. of Inf. Theory IT-29(1983), 5–22.
J. Ax, Solving Diophantine equations modulo every prime, Ann. of Math. 85(1967), 161–187.
M. Boyle and W. Krieger, Sofic systems and factor maps I, Proc. of the Special Year in Dynamical Systems, Univ. of Maryland, College Park, Md., Dec. 1986, to apper.
F. Grunewald and D. Segal, Some general algorithms I: Arithmetic groups, Ann. of Math. 112(1980), 531–583.
_____, Resolution effective de quelques problems diophantiens sur les groupes algebriques lineaires, Comptes Rendus Acad. Sci. Paris 295(1982), Serie 1, 479–481.
_____, Decision problems concerning S-arithmetic groups, Jour. of Sym. Logic 50(1985), 734–772.
T. Hamachi and M. Nasu, Topological conjugacy for 1-block factor maps of subshifts and sofic covers, Preprint, 1984.
K. H. Kim and F. W. Roush, Some results on decidability of shift equivalence, Jour. of Comb., Inf., and Sys. Sci. 4(1979), 123–146.
_____, On strong shift equivalence over a Boolean semiring, Ergod. Th. and Dynam. Sys. 6(1986), 81–97.
M. Nasu, Topological conjugacy for sofic systems, Preprint, 1984.
O. O’Meara, Introduction to Quadratic Forms, Springer, Berlin, 1971.
W. Parry and R. F. Williams, Block coding and a zeta function for finite Markov chains, Proc. of London Math. Soc. 35(1977), 483–495.
R. A. Sarkisian, Galois cohomology and some questions in the theory of algorithms, Sbornik 39(1981), 519–545.
A. Weil, Basic Number Theory, Springer, Berlin, 1973.
E. Weiss, Algebraic Number Theory, McGraw-Hill, New York, 1963.
R. F. Williams, Classification of symbol spaces of finite type, Bull. of Amer. Math. Soc. 77(1971), 439–443.
_____, Classification of subshifts of finite type, Ann. of Math. 98(1973), 120–152. Errata ibid 99(1974), 380–381.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag
About this paper
Cite this paper
Kim, K.H., Roush, F.W. (1988). Decidability of shift equivalence. In: Alexander, J.C. (eds) Dynamical Systems. Lecture Notes in Mathematics, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0082843
Download citation
DOI: https://doi.org/10.1007/BFb0082843
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50174-9
Online ISBN: 978-3-540-45946-0
eBook Packages: Springer Book Archive