RT journal article
T1 Refinement monoids and adaptable separated graphs
A1 Ara, Pere
A1 Bosa, Joan
A1 Pardo Espino, Enrique
A2 Matemáticas
K1 Steinberg algebra
K1 Refinement monoid
K1 Type semigroup
AB 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 we explicitly determine their associated I-systems. We also show that any finitely generated conical refinement monoid can be represented as the monoid of an adaptable separated graph. These results provide the first step toward an affirmative answer to the Realization Problem for von Neumann regular rings, in the finitely generated case.
PB arXiv.org
YR 2019
FD 2019-04-08
LK http://hdl.handle.net/10498/21181
UL http://hdl.handle.net/10498/21181
LA eng
NO First, second and third authors are partially supported by the DGI-MINECO and European Regional Development Fund, jointly, through grants MTM2014-53644-P and MTM2017-83487-P. First and second au- thor acknowledge support from the Spanish Ministry of Economy and Competitiveness, through the Mar ́ıa de Maeztu Programme for Units of Excellence in R&D (MDM-2014-0445). Third 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 13-nov-2026