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

dc.creatorRobertson, David I.
dc.creatorSims, Aidan
dc.date2006-02-07
dc.date2007-12-12
dc.date.accessioned2026-07-07T08:48:39Z
dc.date.available2026-07-07T08:48:39Z
dc.descriptionWe 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^*(Λ).
dc.description9 pages, 1 figure. Numbering of environments and enumeration style changed to match published version. Author contact details updated
dc.identifierhttps://arxiv.org/abs/math/0602120
dc.identifierhttp://arxiv.org/abs/math/0602120
dc.identifierD.I. Robertson and A. Sims, 'Simplicity of C*-algebras associated to higher-rank graphs,' Bull. London Math. Soc., 39 (2007), no. 2, 337--344
dc.identifierdoi:10.1112/blms/bdm006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144019
dc.subjectOperator Algebras
dc.subject46L05
dc.titleSimplicity of C*-algebras associated to higher-rank graphs
dc.typetext

Files

Collections