English

Representing finitely generated refinement monoids as graph monoids

Rings and Algebras 2017-03-02 v3 K-Theory and Homology Operator Algebras

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 II-system at the free primes of the monoid.

Keywords

Cite

@article{arxiv.1606.03862,
  title  = {Representing finitely generated refinement monoids as graph monoids},
  author = {P. Ara and E. Pardo},
  journal= {arXiv preprint arXiv:1606.03862},
  year   = {2017}
}

Comments

Final version

R2 v1 2026-06-22T14:23:46.862Z