Factorizations of polynomials over noncommutative algebras and sufficient sets of edges in directed graphs.

From MaRDI portal
Publication:2583213



Abstract: To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when coefficients of the polynomial can be rationally expressed via elements of a given set of pseudo-roots (edges). Our results are based on a new theorem for directed graphs also proved in this paper.


The topic of noncommutative polynomials is so tricky. One should deal carefully with the roots in this situation (right roots, left roots and pseudo-roots). This paper formulates a class of algebras induced by some directed graphs and shows a relation between it and factorizations in noncommutative algebras. The corner stone in this article is the universal algebra of pseudo-roots, and it is treated in a clear language. I believe the authors have come up with a self contained article and distinguished one.











This page was built for publication: Factorizations of polynomials over noncommutative algebras and sufficient sets of edges in directed graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583213)