论文信息 - Computation of Hilbert-Poincaré series - 字舞流文

Computation of Hilbert-Poincaré series

Abstract We describe a new algorithm for computing standard and multi-graded Hilbert-Poincare series of a monomial ideal. We compare it with different strategies along with implementation details and timing data.

Anna Maria Bigatti

[1] Massimo Caboara,et al. Multigraded Hilbert functions and Buchberger algorithm , 1996, ISSAC '96.

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] H. Michael Möller,et al. The computation of the Hilbert function , 1983, EUROCAL.

[4] Carlo Traverso,et al. A "Divide and Conquer" Algorithm for Hilbert-Poincaré Series, Multiplicity and Dimension of Monomial Ideals , 1993, AAECC.

[5] R. Stanley. Hilbert functions of graded algebras , 1978 .

[6] Michael Eugene Stillman,et al. Computation of Hilbert Functions , 1992, J. Symb. Comput..

[7] F. S. Macaulay. Some Properties of Enumeration in the Theory of Modular Systems , 1927 .

[8] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[9] Michael Francis Atiyah,et al. Introduction to commutative algebra , 1969 .