AF-Embeddings of Graph Algebras
Abstract
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 desingularization.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.