摘要
对有理数域或特征为正的素域上的多项式升列,给出了把它的零点集分解为不可约分支的算法.该算法可以在计算机上用王定康的软件包“wsolve”实现.
In this paper we give an algorithm to decompose the zeros of a polynomial ascending set over retional field or prime fields of positive characteristics into irreducible components, which can be realized on computer by the software package “wsolve” of D. K. Wang.
出处
《应用泛函分析学报》
CSCD
2005年第2期97-105,共9页
Acta Analysis Functionalis Applicata
基金
PartiallysupportedbyNKBRPC(2004CB318000)
关键词
代数簇
不可约分解
算法
特征p
irredacible decomposition of algebzaic varieties
algorithm, characteristic p
