Another algorithm for nonnegative matrices (Q1874285)

Some concepts from matrix theory are recalled and used to present an algorithm for nonnegative matrices that decides about the primitivity and reducibility of a given matrix. The algorithm is based on consideration on the level of the quiver of a nonnegative matrix and its corresponding path category. Necessary tools from representation theory and equivalence relations are used to study properties of a nonnegative matrix which leads to the proposed algorithm. It is pointed out that several aspects of additional statements about a matrix can be derived from the results of the algorithm.