This note extends and strengthens a theorem of Bates that says that row-finite graphs that are strong shift equivalent have Morita equivalent graph C*-algebras. This allows us to ask whether our stronger notion of Morita equivalence does in fact characterise strong shift equivalence. We believe this will be relevant for future research on infinite graphs and their C*-algebras. We also study insplits and outsplits as particular examples of strong shift equivalences and show that the induced Morita equivalences respect a whole family of weighted gauge actions. We then ask whether strong shift equivalence is generated by (generalised) insplits and outsplits.Comment: 14 page
The co-universal C*-algebra of a row-finite graph Let $E $ be a row-finite directed graph. We prove ...
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting ...
Abstract. An action of Zk is associated to a higher rank graph Λ satisfying a mild assumption. This ...
We study several notions of shift equivalence for C*-correspondences and the effect that these equiv...
We introduce the notion of balanced strong shift equivalence between square non-negative integer mat...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
Higher-rank graphs (k-graphs) are a combinatorial model for C*-algebras; indeed, much of the structu...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
We initiate the program of extending to higher-rank graphs (k-graphs) the geometric classification o...
Abstract. Several relations on graphs, including primitive equivalence, ex-plosion equivalence and s...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equi...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
The co-universal C*-algebra of a row-finite graph Let $E $ be a row-finite directed graph. We prove ...
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting ...
Abstract. An action of Zk is associated to a higher rank graph Λ satisfying a mild assumption. This ...
We study several notions of shift equivalence for C*-correspondences and the effect that these equiv...
We introduce the notion of balanced strong shift equivalence between square non-negative integer mat...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
Higher-rank graphs (k-graphs) are a combinatorial model for C*-algebras; indeed, much of the structu...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
We initiate the program of extending to higher-rank graphs (k-graphs) the geometric classification o...
Abstract. Several relations on graphs, including primitive equivalence, ex-plosion equivalence and s...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equi...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
The co-universal C*-algebra of a row-finite graph Let $E $ be a row-finite directed graph. We prove ...
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting ...
Abstract. An action of Zk is associated to a higher rank graph Λ satisfying a mild assumption. This ...