Higher rank graph C*-algebras

dc.creatorKumjian, Alex
dc.creatorPask, David
dc.date2000-07-05
dc.date.accessioned2026-07-07T04:36:15Z
dc.date.available2026-07-07T04:36:15Z
dc.descriptionBuilding on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid. Sufficient conditions on the higher rank graph are found for the associated C*-algebra to be simple, purely infinite and AF. Results concerning the structure of crossed products by certain natural actions of discrete groups are obtained; a technique for constructing rank 2 graphs from ``commuting'' rank 1 graphs is given.
dc.description14 pages, see also http://nyjm.albany.edu:8000/j/2000/6-1nf.htm
dc.identifierhttps://arxiv.org/abs/math/0007029
dc.identifierhttp://arxiv.org/abs/math/0007029
dc.identifierNew York J. Math. 6 (2000), 1-20
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59531
dc.subjectOperator Algebras
dc.subjectCategory Theory
dc.subject46L05 (primary); 46L55 (secondary)
dc.titleHigher rank graph C*-algebras
dc.typetext

Files

Collections