Representing finitely generated refinement monoids as graph monoids

Pere Ara, Enrique Pardo

Research output: Contribution to journalArticleResearchpeer-review

4 Citations (Scopus)

Abstract

© 2017 Elsevier Inc. 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.
Original languageEnglish
Pages (from-to)79-123
JournalJournal of Algebra
Volume480
DOIs
Publication statusPublished - 15 Jun 2017

Keywords

  • Graph monoid
  • Primely generated monoid
  • Refinement monoid
  • Regular monoid

Fingerprint Dive into the research topics of 'Representing finitely generated refinement monoids as graph monoids'. Together they form a unique fingerprint.

Cite this