# AF-embeddability of 2-graph algebras and quasidiagonality of k-graph algebras

@article{Clark2015AFembeddabilityO2,
title={AF-embeddability of 2-graph algebras and quasidiagonality of k-graph algebras},
author={Lisa Orloff Clark and Astrid an Huef and Aidan Sims},
journal={Journal of Functional Analysis},
year={2015},
volume={271},
pages={958-991}
}
• Published 11 August 2015
• Mathematics
• Journal of Functional Analysis

## Figures from this paper

• Mathematics
Transactions of the American Mathematical Society, Series B
• 2021
We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph Λ \Lambda , its cubical (co-)homology and categorical (co-)homology groups are isomorphic in
• Mathematics
Indiana University Mathematics Journal
• 2022
We introduce the notion of a homotopy of product systems, and show that the Cuntz-Nica-Pimsner algebras of homotopic product systems over N^k have isomorphic K-theory. As an application, we give a
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 2021
Abstract We study the structure and compute the stable rank of $C^{*}$-algebras of finite higher-rank graphs. We completely determine the stable rank of the $C^{*}$-algebra when the $k$-graph either
• Mathematics
Bulletin of the London Mathematical Society
• 2020
AF‐embeddability, quasidiagonality and stable finiteness of a C∗ ‐algebra have been studied by many authors and shown to be equivalent for certain classes of C∗ ‐algebras. The crossed products
• Mathematics
• 2017
We prove that if A is a \sigma-unital exact C*-algebra of real rank zero, then every state on K_0(A) is induced by a 2-quasitrace on A. This yields a generalisation of Rainone's work on pure
• Mathematics
• 2018
In this note, we present a new way to associate a spectral triple to the noncommutative $C^*$-algebra $C^*(\Lambda)$ of a strongly connected finite higher-rank graph $\Lambda$. We generalize a
It is shown that if A is a separable, exact C*-algebra which satisfies the Universal Coefficient Theorem (UCT) and has a faithful, amenable trace, then A admits a trace-preserving embedding into a
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 2020
Abstract A simple Steinberg algebra associated to an ample Hausdorff groupoid G is algebraically purely infinite if and only if the characteristic functions of compact open subsets of the unit space
• Mathematics
• 2017
In this paper, we present two new ways to associate a spectral triple to a higher-rank graph $\Lambda$. Moreover, we prove that these spectral triples are intimately connected to the wavelet
• Mathematics
Journal of Mathematical Analysis and Applications
• 2020

## References

SHOWING 1-10 OF 34 REFERENCES

• 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
• 2007
We prove that if Λ is a row‐finite k‐graph with no sources, then the associated C*‐algebra is simple if and only if Λ is cofinal and satisfies Kumjian and Pask's aperiodicity condition, known as
• Mathematics
• 2000
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
We give a detailed survey of the theory of quasidiagonal C*-algebras. The main structural results are presented and various functorial questions around quasidiagonality are discussed. In particular
IfAis an AF algebra andα∈Aut(A), it is shown that AF embeddability of the crossed product,A×αZ, is equivalent toA×αZ being stably finite. This equivalence follows from a simple K-theoretic
Let $E$ be a countable directed graph. We show that $C^*(E)$ is AF-embeddable if and only if no loop in $E$ has an entrance. The proof is constructive and is in the same spirit as the Drinen-Tomforde
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 2013
Abstract Results of Fowler and Sims show that every k-graph is completely determined by its k-coloured skeleton and collection of commuting squares. Here we give an explicit description of the