Representing finitely generated refinement monoids as graph monoids

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…