2006
DOI: 10.1090/s0002-9939-06-08216-5
|View full text |Cite
|
Sign up to set email alerts
|

Contractible subgraphs and Morita equivalence of graph 𝐶*-algebras

Abstract: Abstract. In this paper we describe an operation on directed graphs which produces a graph with fewer vertices, such that the C * -algebra of the new graph is Morita equivalent to that of the original graph. We unify and generalize several related constructions, notably delays and desingularizations of directed graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
14
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 7 publications
1
14
0
Order By: Relevance
“…Several authors in [1], [4], [5] and [21] analyzed certain operations on quivers which preserve the (graded) Morita equivalence class of the associated Leavitt path algebras. This results are algebraic analogue of the analytic results that proved in [10], [12], [13], [16], [17] and [18]. Note that in the above papers the authors explored the connections between symbolic dynamics and Leavitt path algebras (graph C * -algebras).…”
Section: Introductionsupporting
confidence: 58%
“…Several authors in [1], [4], [5] and [21] analyzed certain operations on quivers which preserve the (graded) Morita equivalence class of the associated Leavitt path algebras. This results are algebraic analogue of the analytic results that proved in [10], [12], [13], [16], [17] and [18]. Note that in the above papers the authors explored the connections between symbolic dynamics and Leavitt path algebras (graph C * -algebras).…”
Section: Introductionsupporting
confidence: 58%
“…We begin by establishing a Morita equivalence property which is similar to an analogous property of graph C * -algebras. The C * -result, called Move (R), was shown in [18, Proposition 3.2]; it followed as a special case of the result [14,Theorem 3.1]. Move (R) applies only to very restricted configurations of vertices and edges in a graph.…”
Section: Collapsing At a Regular Vertex That Is Not The Base Of A Loopmentioning
confidence: 99%
“…Instead, we find its quasi-inverse reduction in the final list [ERRS16] of moves on graphs which encode all Morita equivalences between graph C * -algebras. Indeed, reduction -rather than delay -was a central ingredient in [Sø13], and it is more easily recognized as a special case of the general result of [CG06].…”
Section: Reductionmentioning
confidence: 99%