2013
DOI: 10.1007/s10468-013-9421-3
|View full text |Cite
|
Sign up to set email alerts
|

Ideals in Graph Algebras

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
20
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 24 publications
(20 citation statements)
references
References 14 publications
0
20
0
Order By: Relevance
“…Because, we will then have two non-zero graded ideals A = X and B = Y with A B and this is not possible by Lemma , we conclude that the cancellation property holds for non-zero ideals in M . Now the graded ideal M possesses local units, being isomorphic to a Leavitt path algebra of a suitable graph (see [11]). From this, it easy to show that the ideals of M are also the ideals of L. Since M contains every other ideal A of L and is graded (so M A = M ∩ A), we conclude that M is also cancellative.…”
Section: Almost Dedekind Domains and Leavitt Path Algebrasmentioning
confidence: 99%
“…Because, we will then have two non-zero graded ideals A = X and B = Y with A B and this is not possible by Lemma , we conclude that the cancellation property holds for non-zero ideals in M . Now the graded ideal M possesses local units, being isomorphic to a Leavitt path algebra of a suitable graph (see [11]). From this, it easy to show that the ideals of M are also the ideals of L. Since M contains every other ideal A of L and is graded (so M A = M ∩ A), we conclude that M is also cancellative.…”
Section: Almost Dedekind Domains and Leavitt Path Algebrasmentioning
confidence: 99%
“…In general, we do not know how to decide semiprojectivity of non-unital graph algebras, but our result can be extended to those non-unital graph C * -algebras that happen to be gauge invariant ideals of unital ones. Indeed, following [DJS03] as amended in [RT14], we will for any ideal given by an admissible pair (H, R) consider the map…”
Section: Corners Subquotients and Extensionsmentioning
confidence: 99%
“…We shall be using the following generalization of the "hedgehog" graph given in Definition 3.8 to arbitrary graphs (see [26]).…”
Section: A Corner-tree Phenomenamentioning
confidence: 99%