Representing finitely generated refinement monoids as graph monoids
classification
🧮 math.RA
math.KTmath.OA
keywords
graphmonoidmonoidsalgebrasfinitelygeneratedrefinementapproaches
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.