Stable rank of Leavitt path algebras of arbitrary graphs. (Q2865124)

The stable rank of Leavitt path algebras of arbitrary graphs is computed in this work. This extends a previous work by P. Ara and E. Pardo in 2008 where the stable rank is computed for \(L_K(E)\) under the condition that \(E\) be row-finite. Even in an earlier work by G. Aranda Pino, E. Pardo and M. Siles Molina in 2006, the stable rank of \(L_K(E)\) was computed assuming \(E\) to be row-finite and to satisfy condition (K).NEWLINENEWLINE Thus, denoting by \(\text{sr}\) the stable rank, the main theorem states that: (A) \(\text{sr}(L_K(E))=1\) if and only if \(E\) is acyclic; (B) \(\text{sr}(L_K(E))=\infty\) if there is a hereditary and saturated subset \(H\subset E^0\) such that (i) The quotient graph \(E\setminus H\) contains no nontrivial saturated hereditary subsets; (ii) \(E\setminus H\) contains at least one closed path; (iii) \(E\setminus H\) satisfies condition (L); (C) \(\text{sr}(L_K(E))=2\) in the remaining cases.NEWLINENEWLINE The authors mention the fact that the computation of stable rank for arbitrary graphs largely proceeds as it does for row-finite graphs, however they need to extend some results about Leavitt path algebras of row-finite graphs to arbitrary graphs, for instance, the characterization of purely infinite simple Leavitt path algebras (which generalizes the result of Abrams and Aranda dealing with the row-finite case).