Macaulay2 » Documentation
Packages » ResultantComplexes » resultantComplex
next | previous | forward | backward | up | index | toc

resultantComplex -- Resultant complex of sparse system.

Description

This example yields a resultant with a multiple of 7. (Since the family of supports do not satisfy any particular conditions here, the determinant of the complex may have multiplicities. It agrees with the resultant, redefined by D'Andrea and Sombra.) We check the lengths of the co-homologies of the resultant complex localized at the eliminant, which is irreducible and thus generates a prime ideal. Resultant complexes consist of modules over the coefficient ring of the sparse polynomials, they are determined by the lattice points inside sums of Newton polytopes shifted by the Canny Emiris vector, which are stored in mon. The second list choice specifies admissible sub-modules required for the Cayley formula. They are obtained from the lift vectors given in the second argument, provided that these define a tight coherent mixed subdivision (TCMD) of the Newton polytopes: CayleyFormula and mixedSubdivision. To reduce the number of cells in the sub-division, we specify the lift function only at the vertices of the Newton polytopes and not on the entire support sets.
i1 : needsPackage "LocalRings";
i2 : A = QQ[c_1..c_8];
i3 : R = A[t_1..t_2];
i4 : supp = { {{0,0},{2,2},{1,3}}, {{0,2},{2,1},{4,0}}, {{3,0},{1,1}} };
i5 : f = polynomials( gens A, gens R, supp )

         2 2        3          4      2        2     3
o5 = {c t t  + c t t  + c , c t  + c t t  + c t , c t  + c t t }
       2 1 2    3 1 2    1   6 1    5 1 2    4 2   7 1    8 1 2

o5 : List
i6 : (complexRes,mon,choice) = resultantComplex( f, {{0,-12,-4},{-2,-1},{-3,0}}, {1/8,1/3} );
i7 : Res = CayleyFormula(complexRes,mon,choice);
i8 : factor Res

         2               2 7
o8 = (c c  - c c c  + c c )
       4 7    5 7 8    6 8

o8 : Expression of class Product
i9 : CP = complexRes ** A_(radical ideal {Res});
i10 : for i from 0 to length CP list length HH^i CP

o10 = {7, 0, 0}

o10 : List

Ways to use resultantComplex:

  • resultantComplex(List,List,List)
  • resultantComplex(PolynomialRing,List,List,List)

For the programmer

The object resultantComplex is a method function.


The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/ResultantComplexes.m2:415:0.