Publication date
January 2011
DOI Publisher
Institute of Mathematics, Polish Academy of Sciences Journal
Annales Polonici MathematiciAbstract
A natural occcurrence of shift equivalence in a purely algebraic setting is exhibited
A natural occcurrence of shift equivalence in a purely algebraic setting is exhibited
Abstract. Shift-flip systems of finite type can be represented by a pair of zero-one square matrices...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
A G-shift of finite type (G-SFT) is a shift of finite type which commutes with the continuous action...
Let R be a ring. Two square matrices A,B are elementary strong shift equivalent (ESSE-R) over R if t...
Rufus Bowen left a notebook containing 157 open problems and questions. Problem 32 on that list asks...
One generally studies the different types of algebraic structures from the equivalence relation “bei...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
Weak shift equivalence which arises in the dynamical study of certain attractors is shown to be an e...
We modify the Fock representation construction of the CAR-algebra to obtain a new proof for that the...
AbstractThe aim of this paper is twofold. On one side we will characterize observational equivalence...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
AbstractThe polynomials ƒ, g E F[X1,…,Xn] are called shift-equivalent if there exists a shift (α1,…,...
Abstract. Shift-flip systems of finite type can be represented by a pair of zero-one square matrices...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
AbstractWe introduce a new computable invariant for strong shift equivalence of shifts of finite typ...
AbstractWe derive a computable set of necessary and sufficient conditions for the existence of a hom...
A G-shift of finite type (G-SFT) is a shift of finite type which commutes with the continuous action...
Let R be a ring. Two square matrices A,B are elementary strong shift equivalent (ESSE-R) over R if t...
Rufus Bowen left a notebook containing 157 open problems and questions. Problem 32 on that list asks...
One generally studies the different types of algebraic structures from the equivalence relation “bei...
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequenc...
Weak shift equivalence which arises in the dynamical study of certain attractors is shown to be an e...
We modify the Fock representation construction of the CAR-algebra to obtain a new proof for that the...
AbstractThe aim of this paper is twofold. On one side we will characterize observational equivalence...
AbstractFirstly, we show that two primitive Boolean matrices are strong shift equivalent if and only...
AbstractThe polynomials ƒ, g E F[X1,…,Xn] are called shift-equivalent if there exists a shift (α1,…,...
Abstract. Shift-flip systems of finite type can be represented by a pair of zero-one square matrices...
In this paper, we present a completely radical way to investigate the main problem of symbolic dynam...
We define a notion of strong shift equivalence for C* -correspondences and show that strong shift eq...
Add to ORKG