Macaulay2 » Documentation
Packages » Macaulay2Doc :: hilbertPolynomial(Module)
next | previous | forward | backward | up | index | toc

hilbertPolynomial(Module) -- compute the Hilbert polynomial of the module

Synopsis

Description

We compute the Hilbert polynomial of a module.
i1 : R = QQ[a..d];
i2 : M = module monomialCurveIdeal(R, {1,3,4});
i3 : h = hilbertPolynomial M

o3 = 3*P  - 4*P  + P
        0      1    3

o3 : ProjectiveHilbertPolynomial
i4 : hilbertPolynomial(M, Projective=>false)

     1 3    2   13
o4 = -i  + i  - --i
     6           6

o4 : QQ[i]

Ways to use this method: