Skip to main content

Local decomposition algorithms

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

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.E.Alonso, T. Mora, M. Raimondo, A computational model for algebraic power series, J. Pure Appl. Algebra, to appear; a preliminary version appeared as Computing with algebraic series, Proc. ISSAC 89, ACM (1989)

    Google Scholar 

  2. D. Bayer, A. Galligo, M. Stillman, conferences at COCOA I (1986), Luminy (1988) and elsewhere

    Google Scholar 

  3. D. Eisenbud, C. Huneke, A Jacobian method for finding the radical of an ideal, Preprint (1989)

    Google Scholar 

  4. J.C. Faugére, P. Gianni, D. Lazard, T. Mora, Efficient change of ordering for Gröbner bases of zero dimensional ideals, submitted to J. Symb. Comp.

    Google Scholar 

  5. P.Gianni, T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases, AAECC5, L. Notes Comp. Sci. 356 (1989)

    Google Scholar 

  6. P. Gianni, B. Trager, G. Zacharias, Gröbner bases and primary decomposition of polynomial ideals, J. Symb. Comp. 6 (1988), 149–167

    Google Scholar 

  7. M. Giusti, J. Heintz, Un algorithme — disons rapide" — pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionnelles, Proc. MEGA '90, Birkhauser, to appear

    Google Scholar 

  8. A. Kandri Rody, Radical of ideals in polynomial rings

    Google Scholar 

  9. T. Krick, A. Logar, Membership problem, representation problem and the computation of the radical for one-dimensional ideals, Proc. MEGA '90, Birkhauser, to appear

    Google Scholar 

  10. D. Lazard, Solving zero-dimensional algebraic systems, Preprint (1989)

    Google Scholar 

  11. T.Mora, G.Pfister, C.Traverso, An introduction to the tangent cone algorithm, Issues in nonlinear geometry and robotics, JAI Press, to appear

    Google Scholar 

  12. T. Mora, La queste del saint Gr a (A L ), Proc. AAECC 7, Disc. Appl. Math., to appear

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shojiro Sakata

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso, M.E., Mora, T., Raimondo, M. (1991). Local decomposition algorithms. In: Sakata, S. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1990. Lecture Notes in Computer Science, vol 508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54195-0_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-54195-0_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54195-0

  • Online ISBN: 978-3-540-47489-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics