AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only if the Boolean traces of each of their powers are equal. Secondly, we prove that if two matrices over Q+ are strong shift equivalent through positive matrices over R+, then they are strong shift equivalent through matrices over Q+
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
summary:Let $\mathbb {B}_{k}$ be the general Boolean algebra and $T$ a linear operator on $M_{m,n}(...
summary:The set of all $m\times n$ Boolean matrices is denoted by ${\mathbb M}_{m,n}$. We call a mat...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
AbstractWe show that two positive matrices over Q+ or R+ which lie in the same component of a set {M...
This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift ...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
Let R be a ring. Two square matrices A,B are elementary strong shift equivalent (ESSE-R) over R if t...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbol...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
AbstractWe characterize those linear operators T, on the class M of square Boolean matrices (respect...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
summary:Let $\mathbb {B}_{k}$ be the general Boolean algebra and $T$ a linear operator on $M_{m,n}(...
summary:The set of all $m\times n$ Boolean matrices is denoted by ${\mathbb M}_{m,n}$. We call a mat...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
AbstractWe show that two positive matrices over Q+ or R+ which lie in the same component of a set {M...
This thesis studies two independent topics in symbolic dynamics, the positive rational strong shift ...
AbstractFor two square matrices A, B of possibly different sizes with nonnegative integer entries, w...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
Let R be a ring. Two square matrices A,B are elementary strong shift equivalent (ESSE-R) over R if t...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbol...
We study the relations of shift equivalence and strong shift equivalence for matrices over a ring $\...
AbstractWe characterize those linear operators T, on the class M of square Boolean matrices (respect...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
summary:Let $\mathbb {B}_{k}$ be the general Boolean algebra and $T$ a linear operator on $M_{m,n}(...
summary:The set of all $m\times n$ Boolean matrices is denoted by ${\mathbb M}_{m,n}$. We call a mat...