2014
DOI: 10.2969/jmsj/06620581
|View full text |Cite
|
Sign up to set email alerts
|

Atlas of Leavitt path algebras of small graphs

Abstract: The aim of this work is the description of the isomorphism classes of all Leavitt path algebras coming from graphs satisfying Condition (Sing) with up to three vertices. In particular, this classification recovers the one achieved by Abrams et al. [1] in the case of graphs whose Leavitt path algebras are purely infinite simple. The description of the isomorphism classes is given in terms of a series of invariants including the K 0 group, the socle, the number of loops with no exits and the number of hereditary… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 37 publications
0
3
0
Order By: Relevance
“…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. This work can be also of interest, not only for people studying Leavitt path algebras, but also for a broader audience; concretely, for those working on graph C ˚algebras (as these are the analytic cousins of Leavitt path algebras).…”
Section: Introduction and Preliminary Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…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. This work can be also of interest, not only for people studying Leavitt path algebras, but also for a broader audience; concretely, for those working on graph C ˚algebras (as these are the analytic cousins of Leavitt path algebras).…”
Section: Introduction and Preliminary Resultsmentioning
confidence: 99%
“…It was shown in [1,Theorem 2.3] that every shift of a graph E produces an epimorphism between the corresponding Leavitt path algebras over a field K, which is an isomorphism provided the graph E satisfies Condition (L) or the field K is infinite. This result can be extended to arbitrary fields, and the condition can be eliminated, as the second, third and fourth author mentioned in [6] (see page 583) and proved in a condensed way. Here we include a more detailed proof.…”
Section: Non-pismentioning
confidence: 88%
See 1 more Smart Citation