矩阵形式下的一元多项式的可约性研究

On Reducibility of Polynomial of One Indeterminate under Matrix Form

将矩阵引入多项式,给出了多项式的矩阵表示,定义了矩阵多项式的运算。在一元多项式的矩阵形式下,讨论了一元多项式的可约性,得到了一元多项式可约的几个有意义的结果,并通过实例验证了利用计算机研究一元多项式可约性的可行性。

This paper is to, with the introduction of matrix into the polynomial, and the definition of operation of matrix polynomial, discuss the reducibility of one indeterminate under its matrix form, obtain some significant results, and prove its feasibility with the help of computers by employing some concrete cases.