An algorithm for the computation of the radical of an ideal

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2006, Issue , 2006, Pages 191-195

  Laplagne, Santiago ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Algorithms; Complexity; Polynomial ideal; Primary decomposition; Radical

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

POLYNOMIAL IDEAL; PRIMARY DECOMPOSITION; RADICAL;

ALGORITHMS;

EID: 33748985788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145802     Document Type: Conference Paper

References (20)

1. M. Caboara, P. Conti, and C. Traverso. Yet another algorithm for ideal decomposition. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, (12):39-54, 1997.
2. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties and Algorithms. Springer, 1996.
3. D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry. Springer, 1998.
4. W. Decker, G.-M. Gruel, and G. Pfister. Primary decomposition: Algorithms and comparisons. Algorithmic algebra and number theory, Springer Verlag, Heidelberg, pages 187-220, 1998.
5. W. Decker, G. Pfister, and H. Schoenemann. primdec.lib. A SINGULAR 3.0 library for computing primary decomposition and radical of ideals, 2005.
6. A. Dickenstein, N. Fitchas, M. Giusti, and C. Sessa. The membership problem for unmixed polynomial ideals is solvable in single exponential time. Discrete Applied Mathematics, (33):73-94, 1991.
7. T. W. Dube. The structure of polynomial ideals and grobner bases. SIAM J. Comput., (19):750-773, 1990.
8. D. Eisenbud, C. Huneke, and W. Vasconcelos. Direct methods for primary decomposition. Invent. Math., (110):207-235, 1992.
9. P. Gianni, B. Trager, and G. Zacharias. Bases and primary decomposition of ideals. J. Symbolic Computation, (6):149-167, 1988.
10. M. Giusti. Some effective problems in polynomial ideal theory. EUROSAM 84, Lecture Notes in Computer Science, (174):159-171, 1984.
11. G.-M. Greuel and G. Pfister. A Singular Introduction to Commutative Algebra. Springer, 2002.
12. G.-M. Greuel, G. Pfister, and H. Schonemann. SINGULAR 3.0.1. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern, 2005. http://www.singular.uni-kl.de.
13. J. Heintz. Definability and fast quantifier elimination over algebraically closed fields. Theor. Comp. Science, (24):239-278, 1983.
14. G. Kemper. The calculation of radical ideals in positive characteristic. J. Symbolic Computation, (34):229-238, 2002.
15. T. Krick and A. Logar. An algorithm for the computation of the radical of an ideal in the ring of polynomials. AAECC9, Springer LNCS, (539):195-205, 1991.
16. T. Krick and A. Logar. Membership problem, representation problem and the computation of the radical for one-dimensional ideals. Progress in Mathematics, (94):203-216, 1991.
17. T. Krick, L. M. Pardo, and M. Sombra. Sharp estimates for the arithmetic nullstellensatz. Duke Math J., (109):521-598, 2001.
18. R. Matsumoto. Computing the radical of an ideal in positive characteristic. J. Symbolic Computation, (32):263-271, 2001.
19. A. Seidenberg. Constructions in algebra. Trans. Amer. Math. Soc., (197):273-313, 1974.
20. W. Vasconcelos. Computational Methods in Commutative Algebra and Algebraic Geometry. Springer-Verlag, 1998.