The integer 'nu' needs to be a 'good degree' for the first parameter '{f0,f1,f2,f3}' that can be verified by doing isGoodDegree(polinomialList,nu)
degreeImplicitEq computes the degree of the gcd of the maximal minors of the matrix representation of {f0,f1,f2,f3} in degree 'nu', equivalently, the degree of determinant of the Z-complex associated to {f0,f1,f2,f3} in degree 'nu'. This is:
degreeImplicitEq({f0,f1,f2,f3}, nu) = degree(representationMatrix(teToricRationalMap({f0,f1,f2,f3}),nu) that computes 'deg(det((Z(f0,f1,f2,f3))_nu))'
Implicitely, it uses the Newton polytope of {f0,f1,f2,f3}, that can be obtained by doing
polynomialsToPolytope
Given a list of polynomials {f0,f1,f2,f3}, it computes the degree of the gcd of the maximal minors of the right-most map of the strand of degree 'nu'.
Precisely, 'degreeImplicitEq' returns an integer which is the degree of H^{deg(f)}.G, where H is the implicit equation, deg(f) is the degree of f={f0,f1,f2,f3}, and G is an extra factor that may appear.
i1 : S = QQ[s,t];
|
i2 : f0 = s^2+s^3*t;
|
i3 : f1 = s^3*t^6+1;
|
i4 : f2 = s*t^2+2*s^3*t^5;
|
i5 : f3 = s^2+s^3*t^6;
|
i6 : degreeImplicitEq ({f0,f1,f2,f3},2)
o6 = 17
|