Simplicity of C*-algebras associated to higher-rank graphs
Copyright policy )Simplicity of C*-algebras associated to higher-rank graphs
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^*(Λ).
9 pages, 1 figure. Numbering of environments and enumeration style changed to match published version. Author contact details updated
- University of Wollongong Australia
- University of Newcastle Australia Australia
General theory of \(C^*\)-algebras, 46L05, Physical Sciences and Mathematics, Mathematics - Operator Algebras, FOS: Mathematics, Operator Algebras (math.OA)
General theory of \(C^*\)-algebras, 46L05, Physical Sciences and Mathematics, Mathematics - Operator Algebras, FOS: Mathematics, Operator Algebras (math.OA)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).35 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!