Skip to main content
SpringerLink
Log in

On the computation of the radical of polynomial complete intersection ideals

  • Submitted Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 948))

Abstract

This paper deals with the effective computation of the radical of certain polynomial ideals. Let k be a characteristic zero field, f 1,..., f n−r ε k[X 1,..., X n ] a regular sequence with d:=maxj deg fj,

the generated ideal,

its radical, and suppose that the factor ring k[X 1,...,X n ]/

is a Cohen-Macaulay ring. Under these assumptions we exhibit a single exponential algorithm which computes a system of generators of

.

Partially supported by UBACYT and CONICET.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alonso M., Mora T. and Raimondo M.: Local decomposition algorithms.-Proc. 8th. Int. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes AAECC-8, Springer Lect. Notes Comput.Sci. 508 (1991) 208–221.

    Google Scholar 

  2. Bayer D. and Mumford D.: What Can Be Computed in Algebraic Geometry ? Computational Algebraic Geometry and Commutative Algebra, Cortona 1991, D. Eisenbud and L. Robbiano, eds. Symposia Math. XXXIV, Cambridge Univ. Press (1993) 1–48.

    Google Scholar 

  3. Berenstein C. and Struppa D.: Recent improvements in the Complexity of the Effective Nullstellensatz.-Linear Algebra and its Appl. 157 (1991) 203–215.

    Google Scholar 

  4. Berkowitz S.: On computing the determinant in small parallel time using a small number of processors.-Inform. Process. Lett. 18 (1984) 147–150.

    Google Scholar 

  5. Caniglia L., Galligo A. and Heintz J.: Some new effectivity bounds in computational geometry.-Proc. 6th Int. Conf. Applied Algebra, Algebraic Algorithms and Error Correcting Codes AAECC-6, Roma 1988, Springer Lect. Notes Comput.Sci. 357 (1989) 131–151.

    Google Scholar 

  6. Demazure M.: Le monoïde de Mayr et Meyer.-Notes Informelles de Calcul Formel, Ecole Polytechnique, Palaiseau (1984).

    Google Scholar 

  7. Dickenstein A., Giusti M., Fitchas N. and Sessa C.: The membership problem for unmixed polynomial ideals is solvable in single exponential time.-Discrete Appl. Math. 33 (1991) 73–94.

    Google Scholar 

  8. Dickenstein A. and Sessa C.: Duality methods for the membership problem.— Effective Methods in Algebraic Geometry MEGA 90, T. Mora and C. Traverso, eds., Progress in Mathematics Vol. 94, Birkhüser (1991) 89–103.

    Google Scholar 

  9. Eisenbud D., Huneke C. and Vasconcelos W.: Direct methods for primary decomposition.-Inv. Math. 110 (1992) 207–235.

    Google Scholar 

  10. Fitchas N., Giusti M. and Smietanski F.: Sur la complexité du théorème des zéros.-Preprint Ecole Polytechnique Palaiseau (1992).

    Google Scholar 

  11. Giusti M., Heintz J. and Sabia J.: On the efficiency of effective Nullstellensätze.-Comput. Complexity 3, Birkhaüser (1993) 56–95.

    Google Scholar 

  12. Grothendieck A. and Dieudonné J.: Éléments de géométrie algébrique IV.-Publ. Math. Inst. Hautes Étud. Sci. 32 (1967).

    Google Scholar 

  13. Gruson L., Lazarsfeld R. and Peskine C.: On a Theorem of Castelnuovo, and the Equations Defining Space Curves.-Inv. Math. 72 (1983) 493–506.

    Google Scholar 

  14. Heintz J.: Definability and Fast Quantifier Elimination in Algebraically Closed Fields.-Theoret. Comput. Sci. 24 (1983) 239–277.

    Google Scholar 

  15. Iversen B.: Genetic Local Structures in Commutative Algebra.-Lect. Notes in Math. 310, Springer-Verlag (1973).

    Google Scholar 

  16. Kaplansky I.: Commutative tings.-Allyn and Bacon (1970).

    Google Scholar 

  17. Krick T. and Logar A.: An algorithm for the computation of the radical of an ideal in the ring of polynomials.-Proc. AAECC-9, New Orleans 1991. LN Comp. Sci. 539. Springer-Verlag (1992) 195–205.

    Google Scholar 

  18. Kunz E.: Kälher Differentials.-Adv. Lect. in Math., Vieweg Verlag (1986).

    Google Scholar 

  19. Lam T.Y.: Serre's Conjecture.-Springer Lect. Notes in Math. 635 (1978).

    Google Scholar 

  20. Matsumura H.: Commutative ring theory.-Cambridge Studies in Adv. Math. 8 Cambridge University Press (1989).

    Google Scholar 

  21. Mayr E. and Meyer A.: The complexity of the word problem for commutative semigroups and polynomial ideals.-Adv. in Math. 46 (1982) 305–329.

    Google Scholar 

  22. Mumfold D.: Varieties defined by quadratic equations.-Questions on Algebraic Varieties, Centro Internationale de Matematica Estivo, Cremonese, Roma (1970) 29–100.

    Google Scholar 

  23. Rossi F. and Spangher W.: Some effective methods in the openness of loci for Cohen-Macaulay and Gorenstein properties.-Effective Methods in Algebraic Geometry, Proc. Intern. Conf. MEGA 90, Castiglioncello 1990, T. Mora and C. Traverso, eds., Progress in Mathematics Vol. 94 Birkhäuser (1990) 441–455.

    Google Scholar 

  24. Sabia J. and Solernó P.: Bounds for traces in Complete Intersections and Degrees in the Nullstellensatz.-To appear in AAECC Journal, Springer-Verlag (1994).

    Google Scholar 

  25. Serre J.-P.: Algèbre Locale-Multiplicités.-Springer Lect. Notes in Math. 11 (1965).

    Google Scholar 

  26. Teissier B.: Résultats récents d'algèbre commutative effective.-Séminaire Bourbaki 1989–1990, Astérisque vol 189–190 (1991) 107–131.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas. Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, 1428, Buenos Aires, Argentina

    Inés Armendáriz

  2. Departamento de Economía y Matemática, Universidad de San Andrés, Vito Dumas 284, 1644, Victoria, Buenos Aires, Argentina

    Pablo Solernó

Authors
  1. Inés Armendáriz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pablo Solernó
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Marc Giusti Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Armendáriz, I., Solernó, P. (1995). On the computation of the radical of polynomial complete intersection ideals. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-60114-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60114-2

  • Online ISBN: 978-3-540-49440-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation