Simplicity of 2-Graph Algebras Associated to Dynamical Systems
Bulletin of the Malaysian Mathematical Society, Tome 33 (2010) no. 2
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph Λ we consider has an associated C *-algebra, denoted C *(Λ), which is simple and purely infinite when Λ is aperiodic. We give new, straightforward conditions which ensure that Λ is aperiodic. These conditions are highly tractable as we only need to consider the finite set of vertices of Λ in order to identify aperiodicity. In addition, the path space of each 2-graph can be realised as a two-dimensional dynamical system which we show must have zero entropy.
Classification :
Primary: 46L05; Secondary: 37B10.
@article{BMMS_2010_33_2_a1,
author = {Peter Lewin and David Pask},
title = {Simplicity of {2-Graph} {Algebras} {Associated} to {Dynamical} {Systems}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2010},
volume = {33},
number = {2},
url = {http://geodesic.mathdoc.fr/item/BMMS_2010_33_2_a1/}
}
Peter Lewin; David Pask. Simplicity of 2-Graph Algebras Associated to Dynamical Systems. Bulletin of the Malaysian Mathematical Society, Tome 33 (2010) no. 2. http://geodesic.mathdoc.fr/item/BMMS_2010_33_2_a1/