2021
DOI: 10.1016/j.aim.2021.107729
|View full text |Cite
|
Sign up to set email alerts
|

On a class of inverse semigroups related to Leavitt path algebras

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…Ash and Hall in [3] introduced these semigroups to study the nonzero J -classes of inverse semigroups. Graph inverse semigroups are closely related to the study of Leavitt path algebras [1,8] and Cuntz inverse semigroups in the C * -algebras [6,10].…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…Ash and Hall in [3] introduced these semigroups to study the nonzero J -classes of inverse semigroups. Graph inverse semigroups are closely related to the study of Leavitt path algebras [1,8] and Cuntz inverse semigroups in the C * -algebras [6,10].…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…Following [14], consider the multiplicative subsemigroup LI(Γ) of L F (Γ) generated by elements v ∈ V ; e, e * ∈ E ∪ E * . In [14], it is shown that LI(Γ) is an inverse semigroup, which is presented by generators v ∈ V ; e, e * ∈ E ∪ E * , and defining relations (1) − (4) plus the additional relations (5 ′ ) v = ee * , s(e) = v, where v runs over all vertices of index 1.…”
Section: Definitionsmentioning
confidence: 99%
“…•• [14] An arbitrary element of LI(Γ) can be uniquely represented as v or pq * , where p, q are paths in Γ (one of them may have zero length),…”
Section: Definitionsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to deal with actions of groups, it is interesting to work with a class of normal forms which is closed under the action of the group. This description uses only purely multiplicative expressions and is analogous to the one obtained in [43], see also [29].…”
Section: Theorem 36 (Gross-tucker For Separated Graphs) Suppose a Gro...mentioning
confidence: 99%