1) prime polynomial ideal
素多项式理想
2) Polynomial ideal
多项式理想
1.
The notion of partitioned-parametric Grobner bases of a polynomial ideal with parameters is introduced and an algorithm for constructing the partitioned-parametric Grobner bases is given, the correctness and the termination of the algorithm are also proved.
对于含参数的多项式理想,提出了分区参数Grbner基的概念,并且给出了一个计算分区参数Grbner基的算法,证明了该算法的正确性和终止性。
2.
In this paper, a new method of testing Hamilton path is given in simple digraph, via Grbner basis and polynomial ideal, which is simple, efficient and can be easily realized by mathematic software, such as Maple.
通过应用多项式理想理论和Gr bner基方法 ,得出了判断简单图中是否存在哈密顿道路的一种新方法 ,该方法简单、易懂 ,且用数学软件Maple实施起来也非常容
4) monomial ideal
单项式理想
1.
Many important problems in polynomial rings can be reduced to the study of monomial ideals.
单纯复形是与单项式理想间存在着一一对应的关系,且单纯复形的链复形间的映射是边缘算子,根据这种算子,我们试图给出一种更广泛的微分算子来研究多元多项式理想,并且通过该算子将单项式理想的复形与同调的相关结论推广到多元多项式理想。
5) primary polynomial
准素多项式
6) 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.
给出了两两互素多项式下线性变换的核的直和分解,并应用于幂等矩阵(对合矩阵)的秩的等式证明中。
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。