Simplicity of 2-graph algebras associated to Dynamical Systems

Details Simplicity of 2-graph algebras associated to Dynamical Systems Simplicity of 2-graph algebras associated to Dynamical Systems

2009-10-26

arxiv.org/abs/0910.4797v2

Mathematics

Operator Algebras

19 pages

Scientific paper

We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\Lambda$ we consider has an associated $C^*$-algebra, denoted $C^*(\Lambda)$, which is simple and purely infinite when $\Lambda$ is aperiodic. We give new, straightforward conditions which ensure that $\Lambda$ is aperiodic. These conditions are highly tractable as we only need to consider the finite set of vertices of $\Lambda$ 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.

Affiliated with

Also associated with

No associations

Rating

Simplicity of 2-graph algebras associated to Dynamical Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simplicity of 2-graph algebras associated to Dynamical Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplicity of 2-graph algebras associated to Dynamical Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562127