Skip to main content
SpringerLink
Log in

A computational proof of the Noether normalization lemma

  • Full Papers
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1988)

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

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. M.F. Atiyah, I.G. MacDonald, Introduction to Commutative Algebra, Addison-Wesley, Reading, Mass. (1969), IX+128 pp.

    Google Scholar 

  2. B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Ideal, Ph.D. Thesis, Innsbruck, (1965).

    Google Scholar 

  3. B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, Recent trends in multidimensional systems theory Bose N.K. Reidel (1985).

    Google Scholar 

  4. P. Gianni, T. Mora, Algebraic solution of systems of polynomial equations using Gröbner bases. Communication at A.A.E.C.C. 5, Menorca 1987.

    Google Scholar 

  5. P. Gianni, B. Trager, G. Zacharias, Gröbner bases and primary decomposition of polynomial ideals. Preprint (1986).

    Google Scholar 

  6. H. Kredel, V. Weispfenning, Computing dimension and independent sets for polynomial ideals. Preprint (1986).

    Google Scholar 

  7. J. Nagata, Field theory, Marcel Dekker, INC, New York and Basel (1977).

    Google Scholar 

  8. A. Seidenberg, Construction of the integral closure of a finite integral domain, Rend. Sem. Mat. Fis. Milano 40, 101–120, (1970).

    Google Scholar 

  9. A. Seidenberg, Constructions in algebra, Trans. A.M.S.197, 273–313 (1974).

    Google Scholar 

  10. C. Traverso, A study of algebraic algorithms: the normalization, Report Pisa, (1986)

    Google Scholar 

  11. V. Vasconcelos, What is a prime ideal? Preprint.

    Google Scholar 

  12. O. Zariski, P. Samuel, Commutative algebra, I, II, Springer-Verlag (1975).

    Google Scholar 

References

  1. D. Brownawell, Bouds for the degree in the Nullstellensatz, Annals of Math. 2nd ser. 126, n.3,1987, p. 577–591.

    Google Scholar 

  2. L. Caniglia, A. Galligo, J. Heintz, Borne simple exponentielle pour les degrés dans le théorème des zéros sur un corps de caractéristique quelconque. C.R.Acad.Sci. Paris, t.307 Ser.I (1988) 255–258.

    Google Scholar 

  3. L. Caniglia, A. Galligo, J. Heintz, Some new effectivity bounds in computationa geometry. These Proceedings.

    Google Scholar 

  4. N. Fitchas, M. Giusti, The membership problem in the unmixed case is in NC. Manuscript (1988).

    Google Scholar 

  5. A. Galligo, C. Traverso, Practical determination of the dimendion of an algebraic variety. Preprint (1988).

    Google Scholar 

  6. J. Heintz, Definability and fast quantifier elimination in algebraically closed fields. Theoret.Comput.Sci. 24 (1983) 239–277.

    Google Scholar 

  7. J. Kollar, Sharp effective Nullstellensatz. Manuscript (1988).

    Google Scholar 

  8. D. Lazard, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Proc. EUROCAL 1983, Springer L.N.Comp.Sci. 162 (1983).

    Google Scholar 

  9. M. Möller, F. Mora, Upper and lower bounds for the degree of Gröbner bases, Proc. EUROSAM 84 Springer L.N.Comp.Sci. 174 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, p.le Europa, 1, 34100, Trieste, Italy

    Alessandro Logar

Authors
  1. Alessandro Logar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Logar, A. (1989). A computational proof of the Noether normalization lemma. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-51083-4_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51083-3

  • Online ISBN: 978-3-540-46152-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation