Skip to main navigation Skip to search Skip to main content

Simplicity of C*-algebras associated to higher-rank graphs

  • David Robertson
  • , Aidan Sims

Research output: Contribution to journalArticlepeer-review

60 Citations (Scopus)

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 aperiodicity condition, known as Condition (A). We prove that the aperiodicity condition 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*(Λ).
Original languageEnglish
Pages (from-to)337-344
JournalBulletin of the London Mathematical Society
Volume39
Issue number2
Early online date2 Apr 2007
DOIs
Publication statusPublished - Apr 2007

Fingerprint

Dive into the research topics of 'Simplicity of C*-algebras associated to higher-rank graphs'. Together they form a unique fingerprint.

Cite this