Graphs with disjoint cycles classification via the talented monoid (Q2062735)

If \(E\) is a directed graph, the talented monoid \(T_E\) of \(E\) is a pre-ordered abelian monoid with an action of the infinite cyclic group generated by \(x.\) The Grothendieck group \(G_E\) of \(T_E\) is isomorphic to the Grothendieck group \(K^{\operatorname{gr}}_0(L_K(E))\) of the Leavitt path algebra \(L_K(E)\) of \(E\) over any field \(K\) when \(L_K(E)\) is considered as an algebra naturally graded by \(\mathbb Z\) (the action of the infinite cyclic group generated by \(x\) on \(K^{\operatorname{gr}}_0(L_K(E))\) is induced by this natural grading of \(L_K(E)\)). The Graded Classification Conjecture is stating that \(T_E\) (and, equivalently, \(G_E\)) is a complete invariant of the Leavitt path algebra \(L_K(E).\) The work by the authors of this paper is related to this conjecture for finite graphs. The authors show that \(T_E\) of a finite graph \(E\) detects whether all cycles of \(E\) are disjoint (in the sense that every vertex is the base of at most one cycle). The cycles of \(E\) are disjoint if and only if the Gelfand-Kirillov dimension of \(L_K(E)\) is finite. If this dimension is finite, the authors compute it as the length of an order-ideal series of \(T_E.\) Using this result, they show that if two finite graphs are such that there is an order preserving \(\mathbb Z[x, x^{-1}]\)-module isomorphism of their Grothendieck groups, then their Leavitt path algebras have the same Gelfand-Kirillov dimension.