Flow equivalence of diagram categories and Leavitt path algebras (Q2079658)

This article studies Morita equivalence of Leavitt Path algebras in view of diagram categories and flow equivalence. The outlay of the article is as follows: Section 1 and 2 being the introduction, terminology and notation respectively; Section 3 generalized [\textit{A. Koç} and \textit{M. Özaydın}, J. Pure Appl. Algebra 224, No. 3, 1297--1319 (2020; Zbl 1490.16040), Proposition 3.2] to any graphs and any commutative ring in Theorem 3.3 via a new graph construction from the given graph with infinite receivers. When stated with the terminology of this paper, for a given row-finite directed graph \(G\) and field \(F\), Proposition 3.2 of reference [loc. cit.] proves the categorical equivalence of a diagram category over the category of \(Mod(F)\) and the category of modules over the Leavitt path algebra constructed over \(G\). This being the starting point of the paper, it poses three questions in the language of the diagram categories for famous longstanding problem related to the Cuntz-splice on graphs in Question 1.6. Example 4.8 affirmatively answers one of these problems if the category over which the diagram category constructed, is taken to be a partially ordered set. Section 4 considers flow equivalence and known results for row-finite graphs in reference [\textit{G. Abrams} et al., J. Algebra 333, No. 1, 202--231 (2011; Zbl 1263.16007)] are generalized to arbitrary graphs in Theorem 4.2, Theorem 4.13 etc. Some other work in literature is also stated in the diagram category terminology. Note that the terminology of the references and the paper under review should be read carefully, such as sink in one paper, should read as source in the other; as one deals with the graph itself and the other paper with the opposite graph through the construction.