Skip to main content
SpringerLink
Log in

Bounds for degrees and number of elements in Gröbner bases

  • 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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bigatti, A. Caboara, M. Robbiano, L. (1990). On the computation of Hilbert-Poincaré series. Preprint.

    Google Scholar 

  • Buchberger, B. (1985). Gröbner bases: an algorithmic method in polynomial ideal theory. Recent Trends in Multidimensional Systems Theory. (Bose N.K. Ed.) Reidel.

    Google Scholar 

  • Carrá, G. Robbiano, L. (1990). On superG-bases. To appear on J. Pure Appl. Algebra.

    Google Scholar 

  • Elias, J. Robbiano, L. Valla, G. (1989), Number of generators of ideals. Preprint.

    Google Scholar 

  • Geramita, A. Gregory, D. Roberts, L. (1986)Monomial ideals and points in the projective space. J. Pure Appl. Algebra 40 33–62.

    Google Scholar 

  • Giovini, A. Niesi, G. (1990)CoCoA: a user-friendly system for Commutative Algebra. To appear in the Proceedings of the DISCO conference (Capri 1990).

    Google Scholar 

  • Giusti, M. (1984)Some effective problems in polynomial ideal theory. Proceedings of EUROSAM 84 Springer Lecture Notes in Computer Science 174 159–171.

    Google Scholar 

  • Giusti, M. (1988)Combinatorial dimension theory of algebraic varieties. Computational Aspects of Commutative Algebra. Academic Press.

    Google Scholar 

  • Kunz, E. (1980)Einführung in die kommutative Algebra und algebraische Geometrie Vieweg Studium Bd 46 Aufbaukurs Mathematik Braunschweig/Wiesbaden.

    Google Scholar 

  • Lazard, D. (1981)Résolution des systèmes d'équations algébriques. Theoretical Computer Science, 15 77–110.

    Google Scholar 

  • Lazard, D. (1983)Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. EUROCAL 83 Springer Lecture Notes in Computer Science 162.

    Google Scholar 

  • Macaulay, F. S. (1927)Some properties of enumeration in the theory of modular systems. Proc. London Math. Soc. 26 531–555.

    Google Scholar 

  • Matsumura, H. (1970)Commutative Algebra. Benjamin, New York.

    Google Scholar 

  • Möller, M. Mora, T. (1984)Upper and lower bounds for the degree of Gröbner bases. Proceedings of EUROSAM 84 Springer Lecture Notes in Computer Science 174 172–183.

    Google Scholar 

  • Möller, M. Mora, T. (1986)New constructive methods in classical ideal theory. J. Algebra 100 138–178.

    Google Scholar 

  • Robbiano, L. (1983)On normal flatness and some related topics Commutative Algebra: Proceedings of the Trento Conference. Lecture notes in Pure and Applied Mathematics. 84 Marcel Dekker.

    Google Scholar 

  • Robbiano, L. (1988)Introduction to the theory of Gröbner bases, Queen's Papers in Pure and Applied Mathematics N. 80 Vol V.

    Google Scholar 

  • Robbiano, L. (1990)Introduction to the theory of Hilbert functions, To appear in Queen's Papers in Pure and Applied Mathematics.

    Google Scholar 

  • Stanley, R.P. (1978)Hilbert functions of graded algebras, Adv in Math. 28 57–83.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica dell'Universitá di Genova, Via L.B. Alberti 4, 16132, Genova, Italy

    Lorenzo Robbiano

Authors
  1. Lorenzo Robbiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shojiro Sakata

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robbiano, L. (1991). Bounds for degrees and number of elements in Gröbner bases. 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_59

Download citation

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

  • 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

Search

Navigation