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

@inproceedings{Allen2004ADG,
title={A dual graph construction for higher-rank graphs, and K-theory for finite 2-graphs},
author={Stephen Allen and David Pask and Aidan Sims},
year={2004}
}
• Published 8 February 2004
• Mathematics
Given a k-graph A and an element p of N k , we define the dual k-graph, pA. We show that when A is row-finite and has no sources, the C*-algebras C*(A) and C*(pA) coincide. We use this isomorphism to apply Robertson and Steger's results to calculate the K-theory of C*(A) when A is finite and strongly connected and satisfies the aperiodicity condition.
• Mathematics
• 2007
In a previous work, the authors showed that the C*-algebra C*(Λ) of a row-finite higher-rank graph Λ with no sources is simple if and only if Λ is both cofinal and aperiodic. In this paper, we
Given a row-finite k-graph Λ with no sources we investigate the K-theory of the higher rank graph C ∗ -algebra, C ∗ (Λ). When k = 2 we are able to give explicit formulae to calculate the K-groups of
. For a ﬁnitely aligned k -graph Λ with X a set of vertices in Λ we deﬁne a universal C ∗ -algebra called C ∗ (Λ ,X ) generated by partial isometries. We show that C ∗ (Λ ,X ) is isomorphic to the
• Mathematics
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial
• Mathematics
• 2004
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial
• Mathematics
Mathematical Proceedings of the Royal Irish Academy
• 2006
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hubert space and creation operators that are partial
• Mathematics
• 2007
In a number of recent papers, (k + l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C � -algebraic
• Mathematics
• 2007
In a number of recent papers, (k + l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C∗-algebraic
• B. Burgstaller
• Mathematics
Journal of the Australian Mathematical Society
• 2008
Abstract Let $\mathcal {O}$ be a higher rank Exel–Laca algebra generated by an alphabet $\mathcal {A}$. If $\mathcal {A}$ contains d commuting isometries corresponding to rank d and the transition

## References

SHOWING 1-10 OF 20 REFERENCES

Given a row-finite k-graph Λ with no sources we investigate the K-theory of the higher rank graph C *-algebra, C * (Λ). When k = 2 we are able to give explicit formulae to calculate the K-groups of C
• Mathematics
• 2002
It is shown that for any pair (K 0 ,K 1 ) of countable abelian groups, with K 1 free abelian, and any element Ξ ∈ K 0 there exists a purely infinite and simple, stable C * -algebra C * (E)
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 2003
Abstract We consider the higher-rank graphs introduced by Kumjian and Pask as models for higher-rank Cuntz–Krieger algebras. We describe a variant of the Cuntz–Krieger relations which applies to
• Mathematics
• 2003
We show that the Cuntz-Krieger algebras of infinite graphs and infinite {0,1}-matrices can be approximated by those of finite graphs. We then use these approximations to deduce the main uniqueness
• Mathematics
Bulletin of the Australian Mathematical Society
• 1992
We investigate the structure of the C*-algebras 𝒪ρ constructed by Doplicher and Roberts from the intertwining operators between the tensor powers of a representation ρ of a compact group. We show
• Mathematics
Ergodic Theory and Dynamical Systems
• 2004
This paper explores the effect of various graphical constructions upon the associated graph C*-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for
• Mathematics
• 2000
NSKI Abstract. We prove versions of the fundamental theorems about Cuntz-Krieger algebras for the C -algebras of row-finite graphs: directed graphs in which each vertex emits at most finitely many
• Mathematics
• 1998
We associate to each row-nite directed graph E a universal Cuntz-Krieger C-algebra C(E), and study how the distribution of loops in E aects the structure of C(E) .W e prove that C(E) is AF if and
• Mathematics
• 1980
In this paper we present a class of C*-algebras and point out its close relationship to topological Markov chains, whose theory is part of symbolic dynamics. The C*-algebra construction starts from a
• T. Bates
• Mathematics
Bulletin of the Australian Mathematical Society
• 2002
We give applications of the gauge-invariant uniqueness theorem, which states that the Cuntz-Krieger algebras of directed graphs are characterised by the existence of a canonical action of . We