Related papers: Refinement of Higher-Rank Graph Reduction
Higher rank graphs, also known as $k$-graphs, are a $k$-dimensional generalization of directed graphs and a rich source of examples of $C^*$-algebras. In the present paper, we contribute to the geometric classification program for $k$-graph…
We initiate the program of extending to higher-rank graphs ($k$-graphs) the geometric classification of directed graph $C^*$-algebras, as completed in the 2016 paper of Eilers, Restorff, Ruiz, and Sorensen [ERRS16]. To be precise, we…
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 considerations, so they have not been treated…
We show that the C*-algebra of a row-finite source-free k-graph is Rieffel-Morita equivalent to a crossed product of an AF algebra by the fundamental group of the k-graph. When the k-graph embeds in its fundamental groupoid, this AF algebra…
Higher-rank graphs (or $k$-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-Krieger $C^*$-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
We provide a complete classification of the class of unital graph $C^*$-algebras - prominently containing the full family of Cuntz-Krieger algebras - showing that Morita equivalence in this case is determined by ordered, filtered…
We introduce certain $C^*$-algebras and $k$-graphs associated to $k$ finite dimensional unitary representations $\rho_1,...,\rho_k$ of a compact group $G$. We define a higher rank Doplicher-Roberts algebra $\mathcal{O}_{\rho_1,...,\rho_k}$,…
We generalize the classification result of Restorff on Cuntz-Krieger algebras to cover all unital graph C*-algebras with real rank zero, showing that Morita equivalence in this case is determined by ordered, filtered K-theory as conjectured…
In previous work, the authors showed that the C*-algebra C*(\Lambda) of a row-finite higher-rank graph \Lambda with no sources is simple if and only if \Lambda is both cofinal and aperiodic. In this paper, we generalise this result to…
We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…
We develop new techniques for the construction and classification of representations of row-finite and locally convex higher-rank graph C*-algebras O. This class includes Cuntz--Krieger algebras associated to row-finite directed graphs. Our…
For a higher-rank graph $\Lambda$ with sources we detail a construction that creates a higher-rank graph $\bar{\Lambda}$ that does not have sources and contains $\Lambda$ as a subgraph. Furthermore, when $\Lambda$ is row-finite, the…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…
Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
In this paper we describe an operation on directed graphs which produces a graph with fewer vertices, such that the C*-algebra of the new graph is Morita equivalent to that of the original graph. We unify and generalize several related…
K-theory and Ext are computed for the C*-algebra C*(E) of any countable directed graph E. The results generalize the K-theory computations of Raeburn and Szymanski and the Ext computations of Tomforde for row-finite graphs. As a…