A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs
| dc.creator | Allen, Stephen | |
| dc.creator | Pask, David | |
| dc.creator | Sims, Aidan | |
| dc.date | 2004-02-08 | |
| dc.date.accessioned | 2026-07-07T05:05:15Z | |
| dc.date.available | 2026-07-07T05:05:15Z | |
| dc.description | Given a $k$-graph $Λ$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $pΛ$. We show that when $Λ$ is row-finite and has no sources, the $C^*$-algebras $C^*(Λ)$ and $C^*(pΛ)$ coincide. We use this isomorphism to apply Robertson and Steger's results to calculate the $K$-theory of $C^*(Λ)$ when $Λ$ is finite and strongly connected and satisfies the aperiodicity condition. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/math/0402126 | |
| dc.identifier | http://arxiv.org/abs/math/0402126 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70099 | |
| dc.subject | Operator Algebras | |
| dc.subject | 46L05 | |
| dc.title | A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs | |
| dc.type | text |