A dual graph construction for higher-rank graphs, and K-theory for finite 2-graphs | NOVA. The University of Newcastle's Digital Repository

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/24425

Title: A dual graph construction for higher-rank graphs, and K-theory for finite 2-graphs
Author/Creator: Allen, Stephen; Pask, David; Sims, Aidan
Description: Given a k-graph Lambda and an element p of N-k, we define the dual k-graph, p Lambda. We show that when Lambda is row-finite and has no sources, the C*-algebras C*(Lambda) and C*(p Lambda) coincide. We use this isomorphism to apply Robertson and Steger's results to calculate the K-theory of C*(Lambda) when Lambda is finite and strongly connected and satisfies the aperiodicity condition.
Relation: Proceedings of the American Mathematical Society Vol. 134, no. 2, p. 455-464
Date: 2005
Publisher: American Mathematical Society
Keyword(s): graphs as categories; graph algebra; C*-algebra; K-theory; cuntz-krieger algebras; c-asterisk-algebras; infinite-graphs
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/24425
Identifier: ISSN:1088-6826
Language: eng

20 Visitors

36 Hits

NOVA. The University of Newcastle's Digital Repository