The calculation of radical ideals in positive characteristic

Journal of Symbolic Computation

Volumn 34, Issue 3, 2002, Pages 229-238

  Kemper, Gregor ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036749802     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0560     Document Type: Article

References (24)

1. Alonso, M. E., Mora, T., Raimondo, M. (1991). Local decomposition algorithms. In Sakata, S. ed., Applied Algebra, Algebraic Algorithms and Error-correcting Codes (AAECC-8), LNCS 508, pp 208-221. Berlin, Springer.
2. Becker, T., Weispfenning, V. (1993). Gröbner Bases. Berlin, Springer.
3. Bosma, W., Cannon, J.J., Playoust, C. (1997). The Magma algebra system I: the user language. J. Symb. Comput., 24, 235-265.
4. Caboara, M., Conti, P., Traverso, C. (1997). Yet another algorithm for ideal decomposition. In Mattson, H.F., Mora, T. eds, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (AAECC-12), LNCS 1255 , pp. 39-54. Berlin, Springer.
5. Capani A., Niesi, G., Robbiano, L. (2000). CoCoA: A System for Doing Computations in Commutative Algebra, available via anonymous ftp from cocoa.dima.unige.it.
6. Davenport, J. H. (1981). On the Integration of Algebraic Functions, LNCS 102. Berlin, Springer.
7. Davenport, J. H., Trager, B. M. (1981). Factorization over finitely generated fields. In Symbolic and Algebraic Computation, Snowbird/Utah 1981, pp. 200-205. ACM.
8. Decker, W., de Jong, T., Greuel, G-M., Pfister, G. (1999). The normalization: a new algorithm, implementation and comparisons. In Dräxler, P., Michler, G. O.., Ringel, C. M. eds, Computational Methods for Representations of Groups and Algebras, Euroconference in Essen, Germany, April 1-5, 1997, volume 173 of Prog. Math., pp. 177-185. Basel, Birkhäuser.
9. Eisenbud, D. (1995). Commutative Algebra with a View Toward Algebraic Geometry. New York, Springer.
10. Eisenbud, D., Huneke, C., Vasconcelos, W.V. (1992). Direct methods for primary decomposition. Invent. Math., 110, 207-235.
11. Faugère, J. C., Gianni, P., Lazard, D., Mora, T. (1993). Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput., 16, 329-344.
12. Geddes, K. O., Czapor, S. R., Labahn, G. (1992). Algorithms for Computer Algebra. Boston, Kluver.
13. Gianni, P., Mora T., (1989). Algebraic solution of system of polynomial equations using Gröbner bases. In Huguet, L., Poli, A. eds, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (AAECC-5), LNCS 356, pp. 247-257. Berlin, Springer.
14. Gianni, P., Trager, B., Zacharias, G. (1988). Gröbner bases and primary decomposition of polynomial ideals. J. Symb. Comput., 6, 149-267.
15. Grayson, D. R., Stillman, M. E. (1996). Macaulay 2, a Software System for Research in Algebraic Geometry, available at http://www.math.uiuc.edu/Macaulay2.
16. Greuel, G-M., Pfister, G., Schönemann, H. (1998). Singular version 1.2 user manual, Reports On Computer Algebra 21, Centre for Computer Algebra, University of Kaiserslautern, available at http://www.mathematik.uni-kl.de/~zca/singular.
17. Hermann, G. (1926). Die Frage der endlich vielen Schritte in der Theorie der Polynomideale. Math. Ann., 95, 736-788.
18. de Jong, T. (1998). An algorithm for computing the integral closure. J. Symb. Comput., 26, 273-277.
19. Kreuzer, M., Robbiano, L. (2000). Computational Commutative Algebra 1. Berlin, Springer.
20. Krick, T., Logar, A. (1991). An algorithm for the computation of the radical of an ideal in the ring of polynomials. In Mattson, H. F., Mora, T., Rao, T. R. N. eds, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (AAECC-9), LNCS 539, pp. 195-205. Berlin, Springer.
21. Lang, S. (1984). Algebra, 2nd edn. Redwood City, CA, Addison-Wesley.
22. Matsumoto, R. (2000). On computing the integral closure. Comm. Algebr., 28, 401-405.
23. Matsumoto, R. (2001). Computing the radical of an ideal positive characteristic. J. Symb. Comput., 32, 263-271.
24. Seidenberg, A. (1974). Construction in algebra. Trans. Am. Math. Soc., 197, 273-313.