The groupoids of adaptable separated graphs and their type semigroups
MetadataShow full item record
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an E∗-unitary inverse semigroup. As a con- sequence, the tight groupoid of this semigroup is a Hausdorff ́etale groupoid. We show that this groupoid is always amenable, and that the type semigroups of groupoids obtained from adaptable separated graphs in this way include all finitely generated conical refinement monoids. The first three named authors will utilize this construction in forthcoming work to solve the Realization Problem for von Neumann regular rings, in the finitely generated case.