arXiv · math/0402126
A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs
Abstract
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.
Explore related subjects
Keep this discovery
Stephen Allen, David Pask, Aidan Sims. 2004-02-08. A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs. https://arxiv.org/abs/math/0402126
Cite the original work for its findings. Save a collection to share your selection of sources.