Simplicity of C*-algebras associated to higher-rank graphs
Operator Algebras
2007-12-12 v2
Abstract
We prove that if \Lambda is a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if \Lambda is cofinal and satisfies Kumjian and Pask's Condition (A). We prove that Condition (A) is equivalent to a suitably modified version of Robertson and Steger's original nonperiodicity condition (H3) which in particular involves only finite paths. We also characterise both cofinality and aperiodicity of \Lambda in terms of ideals in C^*(\Lambda).
Cite
@article{arxiv.math/0602120,
title = {Simplicity of C*-algebras associated to higher-rank graphs},
author = {David I. Robertson and Aidan Sims},
journal= {arXiv preprint arXiv:math/0602120},
year = {2007}
}
Comments
9 pages, 1 figure. Numbering of environments and enumeration style changed to match published version. Author contact details updated