Computing K-theory and Ext for graph C*-algebras
classification
🧮 math.OA
keywords
graphk-theoryalgebracomputationscountablematrixalgebrascomputed
read the original abstract
K-theory and Ext are computed for the C*-algebra C*(E) of any countable directed graph E. The results generalize the K-theory computations of Raeburn and Szymanski and the Ext computations of Tomforde for row-finite graphs. As a consequence, it is shown that if A is a countable {0,1} matrix and E_A is the graph obtained by viewing A as a vertex matrix, then C*(E_A) is not necessarily Morita equivalent to the Exel-Laca algebra O_A.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.