arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0509260math.QAmath.CO
收藏

Factorizations of Polynomials over Noncommutative Algebras and Sufficient Sets of Edges in Directed Graphs

Israel Gelfand, Sergei Gelfand, Vladimir Retakh, Robert Lee Wilson

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑