A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs

Details A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs

2004-02-08

arxiv.org/abs/math/0402126v1

Mathematics

Operator Algebras

9 pages

Scientific paper

Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^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.

Affiliated with

Also associated with

No associations

Rating

A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30315