Representing finitely generated refinement monoids as graph monoids

Identificadores
Statistics
Metadata
Show full item recordDate
2016-06-14Department
MatemáticasAbstract
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.
Subjects
Refinement monoid; regular monoid; primely generated monoid; graph monoidCollections
- Artículos Científicos [11595]
Related items
Showing items related by title, author, creator and subject.
-
On Ideals of Submonoids of Power Monoids
García García, Juan Ignacio
; Marín Aragón, Daniel
; Vigneron Tenorio, Alberto
(Multidisciplinary Digital Publishing Institute (MDPI), 2025)
-
Primely generated refinement monoids
Ara, P.; Pardo Espino, Enrique
(2014-07-23)
-
Numerical semigroups bounded by the translation of a plane monoid
Moreno Frías, María Ángeles
; Rosales, José Carlos (SPRINGER BASEL AG, 2021-08)





