Finitely generated antisymmetric graph monoids

Pere Ara, Francesc Perera, Friedrich Wehrung

Research output: Contribution to journalArticleResearchpeer-review

6 Citations (Scopus)

Abstract

A graph monoid is a commutative monoid for which there is a particularly simple presentation, given in terms of a quiver. Such monoids are known to satisfy various nonstable K-theoretical representability properties for either von Neumann regular rings or C*-algebras. We give a characterization of graph monoids within finitely generated antisymmetric refinement monoids. This characterization is formulated in terms of the prime elements of the monoid, and it says that each free prime has at most one free lower cover. We also characterize antisymmetric graph monoids of finite quivers. In particular, the monoid Z∞ = {0, 1, 2, ...} ∪ {∞} is a graph monoid, but it is not the graph monoid of any finite quiver. © 2008 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)1963-1982
JournalJournal of Algebra
Volume320
DOIs
Publication statusPublished - 1 Sep 2008

Keywords

  • Antisymmetric
  • C -algebra *
  • Commutative
  • Free element
  • Graph monoid
  • Monoid
  • Prime element
  • Primely generated
  • Primitive
  • Quiver
  • Refinement
  • Regular element
  • Separative
  • Von Neumann regular

Fingerprint Dive into the research topics of 'Finitely generated antisymmetric graph monoids'. Together they form a unique fingerprint.

  • Cite this