Skip to main content
Log in

Advances and improvements in the theory of standard bases and syzygies

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. D.Bayer, The division algorithm and the Hilbert scheme. Thesis, Harvard Univ. 1982.

  2. T.Becker and V.Weispfenning, Gröbner bases. A computational approach to commutative algebra. GTM141, Berlin-Heidelberg-New York 1991.

  3. B.Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Thesis, Univ. Innsbruck, 1965.

  4. B.Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory. In: Recent trends in multidimensional system theory, N. K. Bose, ed., Reidel 1985.

  5. D.Eisenbud, Commutative Algebra with a view toward Algebraic Geometry. Berlin-Heidelberg-New York 1995.

  6. H.-G.Gräbe, The tangent cone algorithm and homogenization. To appear.

  7. G.-M. Greuel, Constant Milnor number implies constant multiplicity for quasihomogeneous singularities. Manuscripta Math.56, 159–166 (1986).

    Google Scholar 

  8. H.Grassmann, G.-M.Greuel, B.Martin, W.Neumann, G.Pfister, W.Pohl, H.Schönemann and T.Siebert, On an implementation of standard bases and syzygies in SINGULAR. To be published in Proceedings of the Workshop Computational Methods in Lie Theory in AAECC.

  9. D. Lazard, Gröbner bases, Gaussian elimination, and resolution of systems of algebraic equations. Proc. EUROCAL 83, Lecture Notes in Comput. Sci.162, 146–156 (1983).

    Google Scholar 

  10. D. T. Lê andK. Saito, La constance du nombre de Milnor donne des bonnes stratifications. C. R. Acad. Sci. Paris, Sér I. Math.277, 793–795 (1973).

    Google Scholar 

  11. T.Mora, An algorithm to compute the equations of tangent cones. Proc. EUROCAM 82, Lecture Notes in Comput. Sci. (1982).

  12. T. Mora, La Queste del Saint Graal: a computational approach to local algebra. Discrete Applied Math.33, 161–190 (1991).

    Google Scholar 

  13. H. M.Möller and T.Mora, Computational aspects of reduction strategies to construct resolutions of monomial ideals. Proc. AAECC 2, Lecture Notes in Comput. Sci.228 (1986).

  14. H. M. Möller andT. Mora, New Constructive Methods in Classical Ideal Theory. J. Algebra100, 138–178 (1986).

    Google Scholar 

  15. H. M.Möller, T.Mora and C.Traverso, Gröbner bases computation using syzygies. Proc. of ISSAC 1992.

  16. T. Mora, G. Pfister andC. Traverso, An introduction to the tangent cone algorithm. Advances im Computing research, Issues in Robotics and nonlinear geometry (6) 199–270 (1992).

    Google Scholar 

  17. D. O'Shea, Topologically trivial deformations of isolated quasihomogeneous hypersurface singularities are equimultiple. Proc. Amer. Math. Soc.101, 260–262 (1987).

    Google Scholar 

  18. F.-O.Schreyer, Die Berechnung von Syzygien mit dem verallgemeinerten Weierstrass'schen Divisionssatz. Diplomarbeit, Hamburg 1980.

  19. O. Zariski, Some open questions in the theory of singularities. Bull. Amer. Math. Soc.77, 481–491 (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The authors were partially supported by the VW-Stiftung, the Stiftung für Innovation Rheinland-Pfalz, the DFG and the ESPRIT BRA contract 6846 POSSO.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Greuel, G.M., Pfister, G. Advances and improvements in the theory of standard bases and syzygies. Arch. Math 66, 163–176 (1996). https://doi.org/10.1007/BF01273348

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation