◍wovepaper
SearchResearchersInstitutions
Sign in
math.OAMay 30, 2014
2
citations (OpenAlex)
authors
  • Christopher Schafhauser
arXiv abstractPDF
paper

AF-Embeddings of Graph Algebras

arXiv:1405.7757

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.

Cited by in corpus (1)

  • AF-embeddability of 2-graph algebras and quasidiagonality of k-graph algebras
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.