On some new invariants for shift equivalence for shifts of finite type

From MaRDI portal
Publication:765143

DOI10.1016/J.JNT.2011.08.003zbMATH Open1333.11108arXiv0809.2713OpenAlexW1983064930MaRDI QIDQ765143FDOQ765143


Authors: Søren Eilers, I. Kiming Edit this on Wikidata


Publication date: 19 March 2012

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: We introduce a new computable invariant for strong shift equivalence of shifts of finite type. The invariant is based on an invariant introduced by Trow, Boyle, and Marcus, but has the advantage of being readily computable. We summarize briefly a large-scale numerical experiment aimed at deciding strong shift equivalence for shifts of finite type given by irreducible 2imes2-matrices with entry sum less than 25, and give examples illustrating to power of the new invariant, i.e., examples where the new invariant can disprove strong shift equivalence whereas the other invariants that we use can not.


Full work available at URL: https://arxiv.org/abs/0809.2713




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: On some new invariants for shift equivalence for shifts of finite type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765143)