Advances and improvements in the theory of standard bases and syzygies

Archiv der Mathematik

Volumn 66, Issue 2, 1996, Pages 163-176

  Greuel, G M ^a   Pfister, G ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030306831     PISSN: 0003889X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01273348     Document Type: Article

References (19)

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. GTM 141, 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. GRABE, 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).
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).
10. D. T. LÊ and K. SAITO, La constance du nombre de Milnor donne des bonnes stratifications. C. R. Acad. Sci. Paris, Sér I. Math. 277, 793-795 (1973).
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).
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 and T. MORA, New Constructive Methods in Classical Ideal Theory. J. Algebra 100, 138-178 (1986).
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 and C. TRAVERSO, An introduction to the tangent cone algorithm. Advances im Computing research, Issues in Robotics and nonlinear geometry (6) 199-270 (1992).
17. D. O'SHEA, Topologically trivial deformations of isolated quasihomogeneous hypersurface singularities are equimultiple. Proc. Amer. Math. Soc. 101, 260-262 (1987).
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).