Balanced strong shift equivalence, balanced in-splits, and eventual conjugacy

DOI10.1017/ETDS.2020.126MaRDI QIDQ3384147zbMATHOpenAlexWikidataFDO

Authors Kevin Aguyar Brix

Publication date 14 December 2021

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

directed graphsbalanced strong shift equivalenceeventual conjugacymoves on graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36) Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25)

Abstract: We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate to balanced strong shift equivalent matrices. Moreover, we show that such graphs are eventually conjugate if and only if one can be reached by the other via a sequence of out-splits and balanced in-splits; the latter move being a variation of the classical in-split move introduced by Williams in his study of shifts of finite type. We also relate one-sided eventual conjugacies to certain block maps on the finite paths of the graphs. These characterizations emphasize that eventual conjugacy is the one-sided analog of two-sided conjugacy.

Recommendations

• Strong shift equivalence and shear adjacency of nonnegative square integer matrices
• On strong shift equivalence of symbolic matrix systems
• scientific article; zbMATH DE number 1370349
• On strong shift equivalence over a Boolean semiring
• scientific article; zbMATH DE number 2158947

Cites work

• scientific article; zbMATH DE number 14993 (Why is no real title available?)
• A class of C*-algebras and topological Markov chains
• A topological invariant of flows on 1-dimensional spaces
• An Introduction to Symbolic Dynamics and Coding
• Automorphisms of one-sided subshifts of finite type
• Classification of subshifts of finite type
• Continuous orbit equivalence, flow equivalence of Markov shifts and circle actions on Cuntz-Krieger algebras
• Cuntz-Krieger algebras and one-sided conjugacy of shifts of finite type and their groupoids
• Diagonal-preserving gauge-invariant isomorphisms of graph \(C^{\ast}\)-algebras
• Flow equivalence and orbit equivalence for shifts of finite type and isomorphism of their groupoids
• Flow equivalence of graph algebras
• Graph algebras and orbit equivalence
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• The Williams conjecture is false for irreducible subshifts
• Uniformly continuous orbit equivalence of Markov shifts and gauge actions on Cuntz-Krieger algebras

Cited in

(3)

• Amplified graph \(C^*\)-algebras. II: Reconstruction
• Combinatorial \(\ast\)-algebras. Abstracts from the workshop held March 10--15, 2024
• Strong shift equivalence and strong Conley index

This page was built for publication: Balanced strong shift equivalence, balanced in-splits, and eventual conjugacy

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