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

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Dokumenter

  • 0809

    Indsendt manuskript, 124 KB, PDF-dokument

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.
OriginalsprogEngelsk
TidsskriftJournal of Number Theory
Vol/bind132
Sider (fra-til)502-510
Antal sider9
ISSN0022-314X
StatusUdgivet - 2012

Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk


Ingen data tilgængelig

ID: 36027601