Representing finitely generated refinement monoids as graph monoids (Q524471)

Building on their earlier paper [Isr. J. Math. 214, No. 1, 379--419 (2016; Zbl 1400.20059)], the authors characterize those finitely generated conical refinement monoids which are graph monoids. Graph monoids arise naturally in the study of non-stable \(K\)-theory of graph \(C^\ast\)-algebras and Leavitt path algebras. They also play an important role in the current approaches to the realization problem for von Neumann regular rings.