Simplicity of 2-graph algebras associated to dynamical systems

zbMATH Open1194.46075arXiv0910.4797MaRDI QIDQ974314FDOQ974314

Authors: Peter Lewin, David Pask 

Publication date: 27 May 2010

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Abstract: 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^{\ast }$-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.

Full work available at URL: https://arxiv.org/abs/0910.4797

Recommendations

• Simplicity of C*-algebras associated to higher-rank graphs
• Periodicity in rank 2 graph algebras
• A family of 2-graphs arising from two-dimensional subshifts
• Simplicity of finitely aligned \(k\)-graph \(C^\ast\)-algebras
• On simplicity of the \(C^\ast \)-algebras associated with \(\lambda \)-graph systems

zbMATH Keywords

simplicityaperiodicityhigher-rank graphshift space\(C^\ast \)-algebra

Mathematics Subject Classification ID

General theory of (C^*)-algebras (46L05) Symbolic dynamics (37B10)

Cited In (1)

• Periodicity in rank 2 graph algebras

This page was built for publication: Simplicity of 2-graph algebras associated to dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974314)