Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T23:20:10.867Z Has data issue: false hasContentIssue false
  • English
  • Français

On strong shift equivalence over a Boolean semiring

Published online by Cambridge University Press:  19 September 2008

Ki Hang Kim  and
Fred W. Roush
Ki Hang Kim
Affiliation:
Mathematics Research Group, Alabama State University, Montgomery, Alabama 36195, USA
Fred W. Roush
Affiliation:
Mathematics Research Group, Alabama State University, Montgomery, Alabama 36195, 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.

Shift equivalence is the relation between A, B that there exists S, R, n > 0 with RA = BR, AS = SB, SR = An, RS = Bn. Strong shift equivalence is the equivalence relation generated by these equations with n = 1. We prove that for many Boolean matrices strong shift equivalence is characterized by shift equivalence and a trace condition. However, we also show that if A is strongly shift equivalent to B, then there exists a homomorphism from an iterated directed edge graph of A to the graph of B preserving the traces of powers. This yields results on colourings of iterated directed edge graphs and might distinguish new strong equivalence classes.

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 6 , Issue 1 , March 1986 , pp. 81 - 97
Copyright
Copyright © Cambridge University Press 1986

References

REFERENCES

[1]Baker, K. A.. Strong shift equivalence of 2×2 matrices of non-negative integers. Ergod. Th. Dynam. Sys. 3 (1983), 541–558.CrossRefGoogle Scholar
[2]Boyle, M.. Private correspondence, 1984.Google Scholar
[3]Hedlund, G. A.. Endomorphisms and automorphisms of the shift dynamical system. Math. Sys. Theory 3 (1969), 320–375.CrossRefGoogle Scholar
[4]Kim, K. H.. Boolean Matrix Theory and Applications. Marcel Dekker, 1982.Google Scholar
[5]Kim, K. H. & Roush, F. W.. Some results on the decidability of shift equivalence. Jour, of Combinatorics, Information, and Systems Sciences 4 (1979), 123–146.Google Scholar
[6]Kim, K. H. & Roush, F. W.. The algebraic structure of the semigroup of binary relations on a finite set. Glasgow Math. Jour. 22 (1981), 57–68.CrossRefGoogle Scholar
[7]Parry, W. & Williams, R. F.. Block coding and a zeta function for finite Markov chains. Proc. London Math. Soc. 35 (1977), 483–495.CrossRefGoogle Scholar
[8]Williams, R. F.. Classification of symbol spaces of finite type. Bull. Amer. Math. Soc. 77 (1971), 439–443.CrossRefGoogle Scholar
[9]Williams, R. F.. Classification of subshifts of finite type. Ann. Math. 98 (1973), 120–152.CrossRefGoogle Scholar
Williams, R. F.. Errata, Ann. Math. 99 (1974), 380–381.CrossRefGoogle Scholar