BigradedImplicit : Index

• BigradedImplicit -- A package for computing implicit equations of bigraded rational surfaces by means of approximation complexes
• degreeImplicitEq -- computes the degree of det((Z)_nu)
• degreeImplicitEq(List,List) -- computes the degree of det((Z)_nu)
• Exact -- Strategy for functions that uses rank computation.
• implicitEq -- computes the gcd of the right-most map of the Z-complex in degree nu)
• implicitEq(..., Strategy => ...) -- computes the gcd of the right-most map of the Z-complex in degree nu)
• implicitEq(List,List) -- computes the gcd of the right-most map of the Z-complex in degree nu)
• isGoodDegree -- verifies if the Z-complex is acyclic in the given degree
• isGoodDegree(List,List) -- verifies if the Z-complex is acyclic in the given degree
• maxMinor -- Returns a maximal minor of the matrix of full rank.
• maxMinor(..., Strategy => ...) -- Returns a maximal minor of the matrix of full rank.
• maxMinor(Matrix) -- Returns a maximal minor of the matrix of full rank.
• Numeric -- Strategy for functions that uses rank computation.
• representationMatrix -- computes the right-most map of the Z-complex in degree nu)
• representationMatrix(List,List) -- computes the right-most map of the Z-complex in degree nu)