arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.10157math.RT
收藏

On complexity of representations of quivers

Victor G. Kac

英文摘要:

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.

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

↑