Abstract
AbstractShift 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
