Computation of Hilbert-Poincaré series

Journal of Pure and Applied Algebra

Volumn 119, Issue 3, 1997, Pages 237-253

  Bigatti, Anna M ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031558146     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(96)00035-7     Document Type: Article

References (15)

1. [1] M.F. Atiyah and I.G. MacDonald, Introduction to Commutative Algebra, Addison-Wesley Series in Mathematics (Addison-Wesley, Reading, MA, 1969).
2. [2] D. Bayer and M. Stillman, Computation of Hubert functions, J. Symbol. Comput. 14 (1992).
3. [3] A.M. Bigatti, M. Caboara and L. Robbiano, On the computation of Hilbert-Poincaré Series, AAECC J. 2 (1991).
4. [4] A.M. Bigatti, P. Conti, R. Robbiano and C. Traverso, A "Divide and Conquer" algorithm for Hilbert-Poincaré series multiplicity and dimension of monomial ideals, Proc. of AAECC-10, Lecture Notes in Computer Science, Vol. 673 (Springer, NewYork, 1993).
5. [5] B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, in: N.K. Bose, ed., Recent Trends in Multidimensional Systems Theory, chap. 6 (Reidel, New York, 1985) 184-232.
6. [6] M. Caboara, G. De Dominicis and L. Robbiano, Multigraded Hubert functions and Buchberger algorithm, Proc. ISSAC 96, to appear.
7. [7] A. Capani, G. Niesi and L. Robbiano, CoCoA, a system for doing Computations in Commutative Algebra, Available via anonymous ftp from lancelot.dima.unige.it (1995).
8. [8] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
9. [9] P. Gianni, T. Mora, L. Robbiano and C. Traverso, Hubert functions and Buchberger algorithm, Preprint (1993).
10. [10] J. Hollman, On the computation of the Hubert series, Latin 92, Sào Paulo, Lecture Notes in Computer Science, Vol. 583 (Springer, New York, 1992).
11. [11] R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity and Computer Computations (Plenum Press, New York, 1972) 85-103.
12. [12] M.V. Kondrat'eva and E.V. Pankrat'ev, A recursive algorithm for the computation of Hilbert polynomial, EUROCAL 87, Lecture Notes in Computer Science, Vol. 387 (Springer, New York, 1987).
13. [13] F.S. Macaulay, Some properties of enumeration in the theory of modular systems, Proc. London Math. Soc. 26(2) (1927) 531-555.
14. [14] M. Möller and T. Mora The computation of the Hilbert function, EUROCAL 83, Lecture Notes in Computer Science, Vol. 162 (Springer, New York, 1983).
15. [15] R.P. Stanley, Hubert functions of graded algebras, Adv. Math. 28 (1978) 57-83.