A certain synchronizing property of subshifts and flow equivalence (Q375880)

From MaRDI portal





scientific article; zbMATH DE number 6221773
Language Label Description Also known as
default for all languages
No label defined
    English
    A certain synchronizing property of subshifts and flow equivalence
    scientific article; zbMATH DE number 6221773

      Statements

      A certain synchronizing property of subshifts and flow equivalence (English)
      0 references
      0 references
      1 November 2013
      0 references
      The author studies the \(\lambda\)-\textit{synchronizing} shift spaces introduced in [\textit{W. Krieger} and \textit{K. Matsumoto}, Acta Appl. Math. 126, No. 1, 263--275 (2013; Zbl 1329.37010)]. This class of shift spaces generalizes the family of synchronized shifts and hence contains irreducible sofic shifts, and more generally, shifts spaces with the specification property. All \(\lambda\)-synchronizing shifts are irreducible (topologically transitive). Furthermore, the Morse shift, Dyck shifts, and \(\beta\)-shifts are also \(\lambda\)-synchronizing. With every \(\lambda\)-synchronizing shift space, one can associate a special graphical representation, a \(\lambda\)-graph system that corresponds to a labelled Bratelli diagram with an additional structure called \(\iota\)-map. The \(\lambda\)-graph for \(\lambda\)-synchronizing shift space generalizes the left Fisher cover of irreducible sofic shift. In the paper under review, the author proves that the \(\lambda\)-synchronization is invariant under flow equivalence of subshifts. This allows him to introduce new flow equivalence invariants for \(\lambda\)-synchronizing shift spaces: the \(\lambda\)-synchronizing \(K\)-groups and the \(\lambda\)-synchronizing Bowen-Franks groups.
      0 references
      lambda-synchronizing
      0 references
      shift spaces
      0 references
      subshifts
      0 references
      flow equivalence
      0 references
      Bowen-Franks groups
      0 references
      \(K\)-groups
      0 references
      lambda-graph systems
      0 references
      Bratelli diagrams
      0 references
      Fisher cover
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references