An introduction to separated graphs and their type semigroups
Abstract
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\'sniewski, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.