Representing finitely generated refinement monoids as graph monoids

JOURNAL OF ALGEBRA

卷:480

Article

Ara, Pere¹  Pardo, Enrique² 

[1] Univ Autonoma Barcelona, Dept Matemat, Bellaterra 08193, Barcelona, Spain

[2] Univ Cadiz, Dept Matemat, Fac Ciencias, Campus Puerto Real, Puerto Real 11510, Cadiz, Spain

关键词: Refinement monoid;    Regular monoid;    Primely generated monoid;    Graph monoid;   

DOI  :  10.1016/j.jalgebra.2017.02.007

来源: Elsevier

【 摘 要 】

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. (C) 2017 Elsevier Inc. All rights reserved.

【 授权许可】

Free