The talented monoid of a directed graph with applications to graph algebras Page 1 Rev. Mat.
Iberoam. 38 (2022), no. 1, 223–256 DOI 10.4171/RMI/1277 © 2021 Real Sociedad …

We extend the equivalence by Cockett and Garner between restriction monoids and ample
categories to the biunary and non-unital setting of Boolean range semigroups which are non …

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 …

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 …

We give a number of constructions where inverse limits seriously degrade properties of
regular rings, such as unit-regularity, diagonalisation of matrices, and finite stable rank. This …

Given a row-finite higher-rank $ k $-graph $\Lambda $, we define a commutative monoid $
T_\Lambda $ which is a higher-rank analogue of the talented monoid of a directed graph …

In this paper we introduce an inverse semigroup $\mathcal {S}(E, C) $ associated to a
separated graph $(E, C) $ and describe its internal structure. In particular we show that it is …

We present a graph-theoretic model for dynamical systems $(X,\sigma) $ given by a
surjective local homeomorphism $\sigma $ on a totally disconnected compact metrizable …

This is an expository paper which provides a quick introduction to Boolean inverse
semigroups and their type monoids, with the emphasis on techniques and insights of the …

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 …