RT journal article
T1 Representing finitely generated refinement monoids as graph monoids
A1 Ara, P.
A1 Pardo Espino, Enrique
A2 Matemáticas
K1 Refinement monoid
K1 regular monoid
K1 primely generated monoid
K1 graph monoid
AB Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this paper, we characterize when a finitely generated conical refinement monoid can be represented as a graph monoid. The characterization is expressed in terms of the behavior of the structural maps of the associated I-system at the free primes of the monoid.
YR 2016
FD 2016-06-14
LK http://hdl.handle.net/10498/18405
UL http://hdl.handle.net/10498/18405
LA eng
NO Both authors are partially supported by the DGI-MINECO and European Regional Development Fund, jointly, through Project MTM2014-53644-P. The second author was partially supported by PAI III grant FQM-298 of the Junta de Andalucía.
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-may-2026