arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0809.2713math.DSmath.NT
收藏

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

Soren Eilers, Ian Kiming

英文摘要:

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 $2\times 2$-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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑