1) reciprocal polynomial
互反多项式
1.
For givenτ andη ,a method which decidesλ to satisfy trinomial is proposed, the acquisition of all trinomials of a m-sequence only depends on the reciprocal polynomial of the primitive polynomial which produces the m-sequence and the cyclotomic cosets mod pn-1.
无需给出 m序列，只需通过产生 m序列的本原多项式的互反多项式以及关于模 pn-1的分圆陪集就可以获得全部序列三项式。
2) reciprocal polynomial
反多项式
3) polynomial coprime
多项式互质
4) coprime polynomial
互素多项式
1.
Through the inquiry into the ranks of coprime polynomial matrices,this paper draws a conclusion: Theorem Let f(x),g(x)∈P?眼x?演 and A∈P n×n,if(f(x),g(x))=1,then n+r?眼f(A)g(A)?演=r(f(A))+r(g(A)).
本文给出了互素多项式在矩阵的秩讨论中的一个简单结果:定理:设f(x),g(x)∈P[x],A是n阶方阵,若(f(x),g(x))=1,则n+r[f(A)g(A)]=r(f(A))+r(g(A))。
2.
The direct sum decomposition of the addition of a linear transformation under the coprime polynomial was given,and it was used in the proof of some equality about the rank of idempotent matrix.
给出了两两互素多项式下线性变换的核的直和分解,并应用于幂等矩阵(对合矩阵)的秩的等式证明中。
5) coprime polynomials
多项式互素
1.
Using the decompositions of Bezout matrix,resultant matrix and Hankel matrix,the authors get several new properties of these matrices above,which give the matrix expressin of coprime polynomials and supply a new method in dealing with polynomial problems.
利用Bezout矩阵、结式矩阵与Hankel矩阵的分解得到了它们的几个新性质,给出了多项式互素的矩阵描述,为处理多项式问题提供了一种新方法。
6) intermass multi formula
互质多项式
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。