Refinement monoids and adaptable separated graphs

All of RECERCAT

Use this identifier to quote or link this document: http://hdl.handle.net/2072/530731

dc.contributor.author	Ara, P.
dc.contributor.author	Bosa, J.
dc.contributor.author	Pardo, E.
dc.date.accessioned	2023-02-03T10:36:15Z
dc.date.available	2023-02-03T10:36:15Z
dc.date.issued	2019-12-11
dc.identifier.uri	http://hdl.handle.net/2072/530731
dc.format.extent	19 p.
dc.language.iso	eng
dc.publisher	Springer
dc.relation.ispartof	Semigroup Forum
dc.rights	L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons:http://creativecommons.org/licenses/by-nc-sa/4.0/
dc.source	RECERCAT (Dipòsit de la Recerca de Catalunya)
dc.subject.other	Matemàtiques
dc.title	Refinement monoids and adaptable separated graphs
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.subject.udc	51 - Matemàtiques
dc.embargo.terms	cap
dc.identifier.doi	10.1007/s00233-019-10077-2
dc.rights.accessLevel	info:eu-repo/semantics/openAccess
dc.description.abstract	e 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.

Files	Size	Format
RefinementMonoids.pdf	352.8 KB	PDF