Elisabetta Fortuna
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.
- 1.ALONSO, M. E., MORA, T., AND RAIMONDO, M. Local decomposition algorithms. In Proceedings of AAECC-8 (Tokyo, 1990), Springer LNCS (1991), vol. 508, pp. 208-221. Google Scholar
Digital Library
- 2.BECKER, T., AND WEISPFENNING, V. GrSbner bases. A computational approach to commutative algebra. Springer Verlag, 1993. Google ScholarDigital Library
- 3.CABOARA, M., CONTI, P., AND TRAVERSO, C. Yet another ideal decomposition algorithm. In Proceedings of AAECC (Toulouse, 1997), Springer LNCS (1997), vol. 1255, pp. 39-54. Google ScholarDigital Library
- 4.EISENBUD, D., HUNEKE, C., AND VASCONCELOS, W. Direct methods for primary decomposition. Invent. math. 110 (1992), 207-235.Google Scholar
- 5.GIANNI, P., AND TRAGER, B. Square-free algorithms in finite characteristic. Journal of the AAECC 7 (1996), 1-14.Google ScholarDigital Library
- 6.GIANNI, P., TRAGER, B., AND ZACHARIAS, G. GrSbner bases and primary decomposition of polynomial ideals. J. Symb. Comp. 6 (1988), 149-167. Google ScholarDigital Library
- 7.KEMPER, G. The calculation of radical ideals in positive characteristic, preprint.Google Scholar
- 8.KRICK, T., AND LOGAR, A. An algorithm for the computation of the radical of an ideal in the ring of polynomials. In Proceedings of AAECC-9 (New Orleans, 1991), Springer LNCS (1991), vol. 539, pp. 195-205. Google ScholarDigital Library
- 9.MINES, R., RICHMAN, F ., AND RUITENBERG, W. A course in constructive algebra. Springer Verlag, 1988.Google ScholarCross Ref
- 10.SEIDENBERG, A. Constructions in algebra. Trans. Amer. Math. Soc. 197 (1974), 273-313.Google ScholarCross Ref
- 11.V.VAsCONCELOS, W. Jacobian matrices and constructions in algebra. In Proceedings of AAECC-9 (New Orleans, 1991), Springer LNCS (1991), vol. 539, pp. 48-64. Google ScholarDigital Library
Index Terms
- Computation of the radical of polynomial ideals over fields of arbitrary characteristic
Recommendations
Cubature Formulae and Polynomial Ideals
The structure of cubature formulae of degree 2n 1 is studied from a polynomial ideal point of view. The main result states that if I is a polynomial ideal generated by a proper set of (2n 1)-orthogonal polynomials and if the cardinality of the variety V(...
Approximate radical of ideals with clusters of roots
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationWe present a method based on Dickson's lemma to compute the "approximate radical" of a zero dimensional ideal I in C[x1, . . . , xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small ...
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04: Proceedings of the 2004 international symposium on Symbolic and algebraic computationLet L be an algebraic function field in k ≥ 0 parameters t;1;, ..., t;k;. Let f;1;, f;2; be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first, a modular GCD algorithm, is an extension of the modular GCD algorithm of ...
Comments