Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T07:11:00.846Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  04 December 2020

KEVIN AGUYAR BRIX*
Affiliation:
School of Mathematics and Applied Statistics, University of Wollongong, Wollongong, NSW 2522, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce the notion of balanced strong shift equivalence between square non-negative 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.

Information

Type
Original Article
Copyright
© The Author(s), 2020. Published by Cambridge University Press