Computation of the radical of polynomial ideals over fields of arbitrary characteristic

Authors:
Elisabetta Fortuna;Patrizia Gianni;Barry Trager
Affiliations:
Univ. di Pisa, Pisa, Italy;Univ. di Pisa, Pisa, Italy;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Year:
2001

Citing 6
Cited 0

Gröbner bases and primary decomposition of polynomial ideals

Journal of Symbolic Computation
Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative algebra
Local Decomposition Algorithms

AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Jacobian Matrices and Constructions in Algebra

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Yet Another Ideal Decomposition Algorithm

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of the computation of the radical of an ideal of polynomials with coefficients over fields of arbitrary characteristic. We show how to use Seidenberg's condition P to solve this problem in the case of positive characteristic.