2011
DOI: 10.1016/j.jalgebra.2011.01.022
|View full text |Cite
|
Sign up to set email alerts
|

Flow invariants in the classification of Leavitt path algebras

Abstract: We analyze in the context of Leavitt path algebras some graph operations introduced in the context of symbolic dynamics by Williams, Parry and Sullivan, and Franks. We show that these operations induce Morita equivalence of the corresponding Leavitt path algebras. As a consequence we obtain our two main results: the first gives sufficient conditions for which the Leavitt path algebras in a certain class are Morita equivalent, while the second gives sufficient conditions which yield isomorphisms. We discuss a p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
109
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 58 publications
(109 citation statements)
references
References 20 publications
0
109
0
Order By: Relevance
“…Let E = (E 0 , E 1 , r E , s E ) be an arbitrary directed graph. 1 We denote the infinite-path space by E ∞ and the finite-path space by E * . We use the convention that a path x is a sequence of edges x i in which each s E (x i ) = r E (x i+1 ) and we write |x| for the length of x.…”
Section: Preliminariesmentioning
confidence: 99%
“…Let E = (E 0 , E 1 , r E , s E ) be an arbitrary directed graph. 1 We denote the infinite-path space by E ∞ and the finite-path space by E * . We use the convention that a path x is a sequence of edges x i in which each s E (x i ) = r E (x i+1 ) and we write |x| for the length of x.…”
Section: Preliminariesmentioning
confidence: 99%
“…The classification problem of Leavitt path algebras (up to isomorphisms) has been present in the literature since the pioneering works [1] and [2]. The study of the classification of Leavitt path algebras associated to small graphs was started in [6], where the authors considered graphs with at most 3 vertices satisfying Condition (Sing), i.e, there is at most one edge between two vertices.…”
Section: Introduction and Preliminary Resultsmentioning
confidence: 99%
“…This question has been investigated in numerous articles, see e.g. [6] and [32]. In large part this research effort has been motivated by the goal of resolving the "Morita equivalence conjecture": if the Leavitt path algebras of the graphs E and F are Morita equivalent, must the corresponding graph C * -algebras for E and F also be (strongly) Morita equivalent?…”
Section: Introductionmentioning
confidence: 99%