Properties of the -Monoid of Weighted Leavitt Path Algebras
Rishabh Goswami, Alfilgen Sebandal
Source abstract
For a row-finite weighted graph , Preusser showed that the monoid of finitely generated projective modules over the weighted Leavitt path algebra is isomorphic to a combinatorially defined weighted graph monoid . We study two structural properties of : confluence and cancellativity. We introduce a reduction system on the free commutative monoid presenting , obtain sufficient conditions for non-confluence by constructing explicit non-confluent triples, and provide a complete confluence characterization for certain classes of weighted graphs. Turning to cancellativity, we work within Preusser's class of weighted graphs satisfying Condition (LPA), for which is isomorphic to an unweighted Leavitt path algebra via a two-step construction. We introduce an auxiliary graph associated to the intermediate step of this construction and use it to give a graph-theoretic characterization of when is cancellative. Finally, under Condition (LPA), we show that Preusser's construction upgrades to a graded isomorphism with respect to the standard -grading of weighted Leavitt path algebras, yielding as -monoids.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.