An introduction to separated graphs and their type semigroups
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910148855857152 |
|---|---|
| author | Ara, Pere |
| author_facet | Ara, Pere |
| contents | We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras associated with separated graphs. These constructions have in common that they have a dynamical behavior, being the groupoid $C^*$-algebras associated to certain topological groupoids, which are built from the combinatorial structure. An important invariant one may associate to these dynamical systems is the so-called type semigroup. We will find a formula to compute the type semigroup for a general self-similar action of a group on a row-finite graph $E$ without sources, following a recent paper by Kwaśniewski, Meyer and Prasad, and for any finite bipartite separated graph, following a paper by Exel and the author. In addition, we will review various results concerning the structure of the type semigroup for different dynamical systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_18304 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An introduction to separated graphs and their type semigroups Ara, Pere Operator Algebras Rings and Algebras We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras associated with separated graphs. These constructions have in common that they have a dynamical behavior, being the groupoid $C^*$-algebras associated to certain topological groupoids, which are built from the combinatorial structure. An important invariant one may associate to these dynamical systems is the so-called type semigroup. We will find a formula to compute the type semigroup for a general self-similar action of a group on a row-finite graph $E$ without sources, following a recent paper by Kwaśniewski, Meyer and Prasad, and for any finite bipartite separated graph, following a paper by Exel and the author. In addition, we will review various results concerning the structure of the type semigroup for different dynamical systems. |
| title | An introduction to separated graphs and their type semigroups |
| topic | Operator Algebras Rings and Algebras |
| url | https://arxiv.org/abs/2604.18304 |