\(K\)-theory for the tame \(C^{\ast}\)-algebra of a separated graph (Q495981)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(K\)-theory for the tame \(C^{\ast}\)-algebra of a separated graph |
scientific article |
Statements
\(K\)-theory for the tame \(C^{\ast}\)-algebra of a separated graph (English)
0 references
16 September 2015
0 references
A separated graph is a pair \((E, C)\) consisting of a directed graph \(E\) with the set of vertices \(E^0\), and a set \(C=\bigsqcup_{v\in E^0}C_v\), where each \(C_v\) is a partition of the set of edges whose terminal vertex is \(v\). In [Adv. Math. 252, 748--804 (2014; Zbl 1319.46046)], the authors have introduced a modification \(O(E,C)\) of the graph \(C^*\)-algebra (the quotient of the latter under certain relations) called a tame graph \(C^*\)-algebra. The paper under review is devoted to evaluation of the \(K\)-theory groups of tame graph \(C^*\)-algebras in the case when all sets in \(C\) are finite.
0 references
separated graph
0 references
refinement monoid
0 references
\(K\)-theory
0 references
partial action
0 references
0 references