AF-Embeddings of Graph Algebras

preprint2014arXivOpen access

Abstract

Let EE be a countable directed graph. We show that C∗(E)C^*(E) is AF-embeddable if and only if no loop in EE has an entrance. The proof is constructive and is in the same spirit as the Drinen-Tomforde desingularization.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.