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*().
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.