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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Operator Algebras, 46L05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144019

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0602120
 http://arxiv.org/abs/math/0602120
 D.I. Robertson and A. Sims, 'Simplicity of C*-algebras associated to higher-rank graphs,' Bull. London Math. Soc., 39 (2007), no. 2, 337--344
 doi:10.1112/blms/bdm006

Collections

arXiv