Papers
Topics
Authors
Recent
2000 character limit reached

The groupoids of adaptable separated graphs and their type semigroup (1904.05197v3)

Published 10 Apr 2019 in math.OA and math.RA

Abstract: 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 consequence, 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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.