Derivations and radicals of polynomial ideals over fields of arbitrary characteristic

被引:7
作者
Fortuna, E
Gianni, P
Trager, B
机构
[1] Univ Pisa, Dipartimento Matemat, I-56127 Pisa, Italy
[2] IBM Res Corp, Yorktown Hts, NY 10598 USA
关键词
D O I
10.1006/jsco.2002.0525
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The purpose of this paper is to give a complete effective solution to the problem of computing radicals of polynomial ideals over general fields of arbitrary characteristic, We prove that Seidenberg's "Condition P" is both a necessary and sufficient property of the coefficient field in order to be able to perform this computation, Since Condition P is an expensive additional requirement on the ground field, we use derivations and ideal quotients to recover as much of the radical as possible, If we have a basis for the vector space of derivations on our ground field, then the problem of computing radicals can be reduced to computing pth roots of elements in finite dimensional algebras, (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:609 / 625
页数:17
相关论文
共 15 条
[1]  
ALONSO ME, 1991, LECT NOTES COMPUT SC, V508, P208
[2]  
[Anonymous], 1988, COURSE CONSTRUCTIVE
[3]  
Becker T., 1993, Graduate Texts in Mathematics
[4]  
Caboara M, 1997, LECT NOTES COMPUT SC, V1255, P39
[5]   DIRECT METHODS FOR PRIMARY DECOMPOSITION [J].
EISENBUD, D ;
HUNEKE, C ;
VASCONCELOS, W .
INVENTIONES MATHEMATICAE, 1992, 110 (02) :207-235
[6]   GROBNER BASES AND PRIMARY DECOMPOSITION OF POLYNOMIAL IDEALS [J].
GIANNI, P ;
TRAGER, B ;
ZACHARIAS, G .
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (2-3) :149-167
[7]  
Gianni P., 1989, EUROCAL '87. European Conference on Computer Algebra Proceedings, P293
[8]   Square-free algorithms in positive characteristic [J].
Gianni, P ;
Trager, B .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1996, 7 (01) :1-14
[9]  
KEMPER G, 2000, CALCULATION RADICAL
[10]  
KRICK T, 1991, LECT NOTES COMPUT SC, V539, P195