The talented monoid of a directed graph with applications to graph algebras (Q832441)

The structure of the talented monoid \(T_E\) associated to a row-finite directed graph \(E\) is investigated, together with ways in which \(T_E\) captures structural properties of both \(E\) and the corresponding Leavitt path algebra \(L_k(E)\) over a field \(k\). The monoid \(T_E\) is isomorphic to the positive cone of the graded Grothendieck group \(K_0^{\text{gr}}(L_k(E))\); it was described completely in terms of the graph \(E\) by the third author and \textit{H. Li} [J. Algebra 547, 430--455 (2020; Zbl 1477.18010)]. The results of the paper provide additional support for the conjecture that \(K_0^{\text{gr}}\) is a complete isomorphism invariant for the Leavitt path algebras of finite graphs over \(k\). \par In particular, standard graph moves are studied. It is shown that the graph moves called source removal, in-splitting and out-splitting, which are known to preserve graded Morita equivalence of Leavitt path algebras, also preserve the talented monoids. On the other hand, expansion and contraction, which are known to preserve Morita equivalence but not graded Morita equivalence, do not always preserve the talented monoids. \par Other properties of \(E\) investigated here include adjacency matrices, extreme cycles, cycles with exits, and periods. For example: (1) A bijection is constructed between the disjoint extreme cycles of \(E\) and certain specified order ideals of \(T_E\); (2) A sourceless finite graph \(E\) is strongly connected with period \(d\) if and only if \(T_E\) is a direct sum of a simple order ideal \(I\) and \(d-1\) successive shifts of \(I\); (3) Conditions on a finite sinkless graph \(E\) are identified which are equivalent to \(L_k(E)\) being purely infinite simple with zero component being a direct sum of \(d\) minimal ideals. The latter result refines the characterization of purely infinite simplicity for Leavitt path algebras of finite graphs obtained by \textit{G. Abrams} et al. [J. Algebra 333, No. 1, 202--231 (2011; Zbl 1263.16007)].