Computing zero-dimensional schemes

Journal of Symbolic Computation

Volumn 39, Issue 1, 2005, Pages 31-49

  Abbott, J ^a   Kreuzer, Martin ^b   Robbiano, L ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF REGENSBURG   (Germany)

Author keywords

Fat points; Gr bner basis algorithm; Zero dimensional schemes

Indexed keywords

EID: 11044222872     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2004.09.001     Document Type: Article

References (16)

1. J. Abbott A. Bigatti M. Kreuzer L. Robbiano Computing ideals of points J. Symbolic Comput. 30 2000 341-356
2. A. Bigatti R. La Scala L. Robbiano Computing toric ideals J. Symbolic Comput. 27 1999 351-365
3. B. Buchberger Gröbner bases: An algorithmic method in polynomial ideal theory In: N.K. Bose Ed. Multidimensional Systems Theory 1985 D. Reidel Publishing Co., Dordrecht pp. 184-232
4. B. Buchberger H.M. Möller The construction of multivariate polynomials with preassigned zeros In: J. Calmet Ed. Proceedings of the European Computer Algebra Conference, EUROCAM'82 Lecture Notes in Comp. Sci. vol. 144 1982 Springer pp. 24-31
5. M. Caboara L. Robbiano Families of estimable terms Proceedings of ISSAC 2001 2001 ACM Press 56-63
6. Capani, A., Niesi, G., Robbiano, L., 1998. CoCoA, A system for doing computations in commutative algebra, Available via anonymous ftp from ftp://cocoa.dima.unige.it, version 4
7. Cioffi, F., 1998. Minimally generating ideals of points in polynomial time using linear algebra. Ricerche di Matematica, XLVII fasc. 2
8. F. Cioffi F. Orecchia Computation of minimal generators of ideals of fat points Proceedings of ISSAC 2001 2001 ACM Press pp. 72-76
9. J.C. Faugère P. Gianni D. Lazard T. Mora Efficient computation of zero-dimensional Gröbner bases by change of ordering J. Symbolic Comput. 16 4 1989 329-344
10. M. Kreuzer On the canonical module of a 0-dimensional scheme Canad. J. Math. 46 1994 357-379
11. M. Kreuzer L. Robbiano Computational Commutative Algebra 1 2000 Springer Heidelberg
12. Kreuzer, M., Robbiano, L., Computational Commutative Algebra 2. Springer, Heidelberg (in press)
13. Y. Lakshman A single exponential bound on the complexity of computing Gröbner bases of zero dimensional ideals In: T. Mora C. Traverso Eds. Proceedings of MEGA-90, Castiglioncello, Italy Progress in Math. vol. 94 1991 Birkhäuser Boston pp. 227-234
14. M. Marinari H. Moeller T. Mora Grodie;bner bases of ideals defined by functionals with an application to ideals of projective points Appl. Algebra Engrg., Comm. Comput. 4 2 1993 103-145
15. B. Mourrain A new criterion for normal form algorithms In: M. Fossier H. Imai S. Lin A. Poli Eds. Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes Lecture Notes in Comp. Sci. vol. 1719 1999 Springer pp. 439-443
16. Robbiano, L., 2001. Zero-dimensional ideals or the inestimable value of estimable terms (preprint)