next | previous | forward | backward | up | top | index | toc | Macaulay2 website
Points :: projectiveFatPointsByIntersection

projectiveFatPointsByIntersection -- computes ideal of fat points by intersecting powers of point ideals

Synopsis

Description

This function computes the ideal of a finite set of fat points by intersecting powers of the ideals of each point.

i1 : R = QQ[x,y,z]

o1 = R

o1 : PolynomialRing
i2 : M = transpose matrix{{1,0,0},{0,1,1}}

o2 = | 1 0 |
     | 0 1 |
     | 0 1 |

              3        2
o2 : Matrix ZZ  <--- ZZ
i3 : mults = {3,2}

o3 = {3, 2}

o3 : List
i4 : projectiveFatPointsByIntersection(M,mults,R)

       2        2    3   3       2     3       2      3   2 3
o4 = {y z - 2y*z  + z , y  - 3y*z  + 2z , x*y*z  - x*z , x z }

o4 : List

See also

Ways to use projectiveFatPointsByIntersection :

For the programmer

The object projectiveFatPointsByIntersection is a method function.