Skip to main content
SpringerLink
Log in

Some effectivity problems in polynomial ideal theory

  • Groebner Basis Algorithms
  • Conference paper
  • First Online:
EUROSAM 84 (EUROSAM 1984)

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

Included in the following conference series:

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.

References

  1. B. ANGÉNIOL, Résidus et effectivité, Preprint Centre de Mathématiques de l'Ecole Polytechnique, 1984.

    Google Scholar 

  2. D. BAYER, The division algorithm and the Hilbert scheme, PhD thesis, Harvard, Mass., USA (1982).

    Google Scholar 

  3. B. BUCHBERGER, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequat. math. 4 (1970), 374–383.

    Google Scholar 

  4. B. BUCHBERGER, A criterion for detecting unnecessary reductions in the construction of Gröbner bases, Eurosam 79, Lect. Notes in Computer Science 72 (1979), 3–21, Springer Verlag.

    Google Scholar 

  5. J. BRIANÇON, A. GALLIGO, Déformations de points de ℝ2 ou ℂ2, Astérisque no 7–8 (1973), 129–138.

    Google Scholar 

  6. A. GALLIGO, A propos du théorème de préparation de Weierstrass, Lect. Notes in Mathematics 409 (1973), 543–579, Springer Verlag.

    Google Scholar 

  7. A. GALLIGO, Algorithmes de calcul de bases standard, Preprint, Université de Nice, Math. no 9 (1983).

    Google Scholar 

  8. M. GERSTENHABER, On the deformations of rings and algebras, Ann. of Math. 79, 1 (1964).

    Google Scholar 

  9. M. GIUSTI, Bases standard et profondeur, Journées Calcul Formel, Luminy (1983), à paraître dans CALSYF.

    Google Scholar 

  10. D. LAZARD, Algèbre linéaire sur K[x1,...,xn] et élimination, Bull. Soc. Math. France, 105 (1977), 165–190.

    Google Scholar 

  11. D. LAZARD, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Eurocam 83, to appear in Lect. Notes in Computer Sciences (Springer).

    Google Scholar 

  12. E. MAYR, A. MEYER, The complexity of the word problems for commutative semi-groups and polynomial ideals, Adv. in Maths. 46 (1982), 305–329.

    Google Scholar 

  13. H. MÖLLER, F. MORA, New constructive methods in classical ideal theory, Preprint, Fernuniversität Hagen, RFA.

    Google Scholar 

  14. H. MÖLLER, F. MORA, Upper and lower bounds for the degree of Gröbner bases, These proceedings.

    Google Scholar 

  15. F.O. SCHREYER, Die Berechnung von Syzygien mit dem verallgemeinerten Weierstrassschen Divisionsatz und eine Anwendung auf analytische Cohen-Macaulay Stellenalgebren minimaler Multiplizität, Diplomarbeit am Fachbereich Mathematik der Universität Hamburg (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Associé au C.N.R.S. no 169, Centre de Mathématiques de l'Ecole Polytechnique, Plateau de Palaiseau, 91128, Palaiseau Cedex, France

    M. Giusti

Authors
  1. M. Giusti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giusti, M. (1984). Some effectivity problems in polynomial ideal theory. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032839

Download citation

  • DOI: https://doi.org/10.1007/BFb0032839

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

  • Online ISBN: 978-3-540-38893-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation