2002
DOI: 10.1006/jfan.2001.3830
|View full text |Cite
|
Sign up to set email alerts
|

Graph C*-Algebras with Real Rank Zero

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(20 citation statements)
references
References 13 publications
0
20
0
Order By: Relevance
“…• Recall that for a subgraph F of E the loop completion t E {F) is the subgraph of E obtained by adding all the loops based at vertices of F° to the graph F, and the loop contraction tc{F) of F is the graph obtained by shrinking each loop in F to a loop consisting of a single edge, [8 (2) => (1). By considering the desingularization we may assume that £ is a rowfinite graph with no sinks.…”
Section: Proposition 33 (See [9 Theorem 46]) Let E Satisfy Conditmentioning
confidence: 99%
See 2 more Smart Citations
“…• Recall that for a subgraph F of E the loop completion t E {F) is the subgraph of E obtained by adding all the loops based at vertices of F° to the graph F, and the loop contraction tc{F) of F is the graph obtained by shrinking each loop in F to a loop consisting of a single edge, [8 (2) => (1). By considering the desingularization we may assume that £ is a rowfinite graph with no sinks.…”
Section: Proposition 33 (See [9 Theorem 46]) Let E Satisfy Conditmentioning
confidence: 99%
“…Recently, for graph C*-algebras their ideal structures, simplicity criteria, and their K-theory have been studied by many authors (see [1,2,6,[8][9][10][11]13] among others), and we know from [9] and [8] that if £ is a locally finite directed graph then its graph C*-algebra C*(E) has real rank zero exactly when the graph E satisfies loop condition (K), which implies that for a Cuntz-Krieger algebra 6 B , where B is the edge matrix of a finite graph E, RR{0 B ) = 0 if and only if the matrix B satisfies condition (II) considered in [4]. The purpose of this paper is to generalize this result to an arbitrary graph E (see Theorem 3.5).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A C * -algebra A has real-rank zero if the set of invertible self-adjoint elements of the minimal unitisation of A is dense in the set of all self-adjoint elements in the minimal unitisation of A [4]. For k = 1, it was established in the locally finite case in [14,15], and in general by Hong and Szymański in [13,Theorem 2.5], that a graph C * -algebra C * (E) has real-rank zero if and only if the graph satisfies Condition (K). However, the methods of [14,15,13] do not generalise to k-graphs.…”
Section: Introductionmentioning
confidence: 99%
“…For k = 1, it was established in the locally finite case in [14,15], and in general by Hong and Szymański in [13,Theorem 2.5], that a graph C * -algebra C * (E) has real-rank zero if and only if the graph satisfies Condition (K). However, the methods of [14,15,13] do not generalise to k-graphs. So we restrict our attention to the special case of k-graphs Λ for which C * (Λ) is purely infinite.…”
Section: Introductionmentioning
confidence: 99%