arXiv · math/0602120
Simplicity of C*-algebras associated to higher-rank graphs
Abstract
We prove that if Λis a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if Λ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 Λin terms of ideals in C^*(Λ).
Explore related subjects
Keep this discovery
David I. Robertson, Aidan Sims. 2007-12-12. Simplicity of C*-algebras associated to higher-rank graphs. https://doi.org/10.1112/blms%2Fbdm006
Cite the original work for its findings. Save a collection to share your selection of sources.