Refinement monoids and adaptable separated graphs

DOI10.1007/S00233-019-10077-2MaRDI QIDQ6316910arXivWikidataFDO

Authors Pere Ara, Joan Bosa, Enrique Pardo Espino

Publication date 8 April 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00233-019-10077-2

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Commutative semigroups (20M14)

arXiv classification

math.OAmath.RA

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

This page was built for publication: Refinement monoids and adaptable separated graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316910)