research

AF-Embeddings of Graph Algebras

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

    Similar works

    Full text

    thumbnail-image

    Available Versions