The Groupoids of Adaptable Separated Graphs and Their Type Semigroups

@article{Ara2019TheGO,
  title={The Groupoids of Adaptable Separated Graphs and Their Type Semigroups},
  author={Pere Ara and Joan Bosa and Enrique Pardo and Aidan Sims},
  journal={International Mathematics Research Notices},
  year={2019}
}
  • P. AraJ. Bosa A. Sims
  • Published 10 April 2019
  • Mathematics
  • International Mathematics Research Notices
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 étale 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… 
View PDF on arXiv
6 Citations
Background Citations
4
Methods Citations
2
Results Citations
2

6 Citations

Refinement monoids and adaptable separated graphs

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and…

The type semigroup, comparison, and almost finiteness for ample groupoids

Abstract We prove that a minimal second countable ample groupoid has dynamical comparison if and only if its type semigroup is almost unperforated. Moreover, we investigate to what extent a not…

The realization problem for finitely generated refinement monoids

We show that every finitely generated conical refinement monoid can be represented as the monoid $$\mathcal V (R)$$ V ( R ) of isomorphism classes of finitely generated projective modules over a von…

The talented monoid of a directed graph with applications to graph algebras

It is a conjecture that for the class of Leavitt path algebras associated to finite directed graphs, their graded Grothendieck groups $K_0^{\mathrm{gr}}$ are a complete invariant. For a Leavitt path…

Leavitt path algebras over a poset of fields

  • P. Ara
  • Mathematics
    Contemporary Mathematics
  • 2019
Let $E$ be a finite directed graph, and let $I$ be the poset obtained as the antisymmetrization of its set of vertices with respect to a pre-order $\le$ that satisfies $v\le w$ whenever there exists…

The realization problem for finitely generated refinement monoids

We show that every finitely generated conical refinement monoid can be represented as the monoid V(R)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts}…

References

SHOWING 1-10 OF 53 REFERENCES

Graph inverse semigroups: their characterization and completion

Refinement monoids and adaptable separated graphs

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and…

Graphs, Groupoids, and Cuntz–Krieger Algebras

We associate to each locally finite directed graphGtwo locally compact groupoidsGandG(★). The unit space ofGis the space of one–sided infinite paths inG, andG(★) is the reduction ofGto the space of…

Inverse semigroups with zero: covers and their structure

Abstract We obtain analogues, in the setting of semigroups with zero, of McAlister's convering theoren and the structure theorems of McAlister, O'Carroll, and Margolis and Pin. The covers come from a…

Topological full groups of ample groupoids with applications to graph algebras

We study the topological full group of ample groupoids over locally compact spaces. We extend Matui’s definition of the topological full group from the compact to the locally compact case. We provide…

A Groupoid Approach to Discrete Inverse Semigroup Algebras

Groupoids and C * -algebras for categories of paths

In this paper we describe a new method of defining C*-algebras from oriented combinatorial data, thereby generalizing the constructions of algebras from directed graphs, higher-rank graphs, and…

Representing finitely generated refinement monoids as graph monoids

Finitely generated antisymmetric graph monoids

Inverse semigroups and combinatorial C*-algebras

Abstract.We describe a special class of representations of an inverse semigroup S on Hilbert's space which we term tight. These representations are supported on a subset of the spectrum of the…
...