(Q,inG,G) = affineFatPoints(M,mults,R)
This function uses a modified Buchberger-Moeller algorithm to compute a grobner basis for the ideal of a finite number of fat points in affine space.
|
|
|
|
|
This algorithm may be faster than computing the intersection of the ideals of each fat point.
|
|
|
|
|
|
|
For reduced points, this function may be a bit slower than affinePoints.
The object affineFatPoints is a method function.