sourceInversionFactor(...,Strategy=>...) -- Determines the desired Strategy in each function.
Description
In sourceInversionFactor, isBirationalMap, isBirationalOntoImage, isEmbeddinga and inverseOfMap, Strategy may assumed any of three options ReesStrategy, SimisStrategy or HybridStrategy (default). These functions as well as jacobianDualMatrix may also attain the Strategy=>SaturationStrategy or ReesStrategy (default).
Further information
-
Default value: HybridStrategy
-
Function: sourceInversionFactor -- Computes the the common factor among the the components of the composition of the inverse map and the original map.
-
Option key: Strategy -- an optional argument
Functions with optional argument named Strategy :
-
"addHook(...,Strategy=>...)" -- see addHook -- add a hook function to an object for later processing
-
"annihilator(...,Strategy=>...)" -- see annihilator -- the annihilator ideal
-
"associatedPrimes(...,Strategy=>...)" -- see associatedPrimes -- find associated primes
-
"basis(...,Strategy=>...)" -- see basis -- basis or generating set of all or part of a ring, ideal or module
-
"mingens(...,Strategy=>...)" -- see Complement -- a Strategy option value
-
"trim(...,Strategy=>...)" -- see Complement -- a Strategy option value
-
determinant(...,Strategy=>...) -- choose between Bareiss and Cofactor algorithms
-
"dual(MonomialIdeal,List,Strategy=>...)" -- see dual(MonomialIdeal,Strategy=>...)
-
"dual(MonomialIdeal,RingElement,Strategy=>...)" -- see dual(MonomialIdeal,Strategy=>...)
-
dual(MonomialIdeal,Strategy=>...)
-
exteriorPower(...,Strategy=>...) -- choose between Bareiss and Cofactor algorithms
-
"gb(...,Strategy=>...)" -- see gb -- compute a Gröbner basis
-
gcdLLL(...,Strategy=>...) (missing documentation)
-
"GF(...,Strategy=>...)" -- see GF -- make a finite field
-
"groebnerBasis(...,Strategy=>...)" -- see groebnerBasis -- Gröbner basis, as a matrix
-
hermite(...,Strategy=>...) (missing documentation)
-
"hooks(...,Strategy=>...)" -- see hooks -- list hooks attached to a key
-
"idealizer(...,Strategy=>...)" -- see idealizer -- compute Hom(I,I) as a quotient ring
-
integralClosure(...,Strategy=>...) -- control the algorithm used
-
"intersect(Ideal,Ideal,Strategy=>...)" -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
-
"intersect(Module,Module,Strategy=>...)" -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
-
"intersectInP(...,Strategy=>...)" -- see intersectInP(...,BasisElementLimit=>...) -- Option for intersectInP
-
"isPrimary(...,Strategy=>...)" -- see isPrimary -- determine whether a submodule is primary
-
"isPrime(Ideal,Strategy=>...)" -- see isPrime(Ideal) -- whether an ideal is prime
-
LLL(...,Strategy=>...) -- choose among different algorithms
-
"localize(...,Strategy=>...)" -- see localize -- localize an ideal at a prime ideal
-
"match(...,Strategy=>...)" -- see match -- regular expression matching
-
"decompose(Ideal,Strategy=>...)" -- see minimalPrimes -- minimal primes of an ideal
-
"minimalPrimes(...,Strategy=>...)" -- see minimalPrimes -- minimal primes of an ideal
-
minors(...,Strategy=>...) -- choose between Bareiss and Cofactor algorithms
-
"primaryComponent(...,Strategy=>...)" -- see primaryComponent -- find a primary component corresponding to an associated prime
-
pushForward(...,Strategy=>...) (missing documentation)
-
quotient(...,Strategy=>...)
-
"radical(...,Strategy=>...)" -- see radical -- the radical of an ideal
-
"radicalContainment(...,Strategy=>...)" -- see radicalContainment -- whether an element is contained in the radical of an ideal
-
"analyticSpread(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"distinguished(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"isLinearType(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"isReduction(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"minimalReduction(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"multiplicity(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"normalCone(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"reesAlgebra(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"specialFiber(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"specialFiberIdeal(...,Strategy=>...)" -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
"regSeqInIdeal(...,Strategy=>...)" -- see regSeqInIdeal -- a regular sequence contained in an ideal
-
resolution(...,Strategy=>...)
-
saturate(...,Strategy=>...)
-
"inverseOfMap(...,Strategy=>...)"
-
"isBirationalMap(...,Strategy=>...)"
-
"isBirationalOntoImage(...,Strategy=>...)"
-
"isEmbedding(...,Strategy=>...)"
-
"jacobianDualMatrix(...,Strategy=>...)"
-
sourceInversionFactor(...,Strategy=>...) -- Determines the desired Strategy in each function.
-
"primaryDecomposition(...,Strategy=>...)" -- see strategies for computing primary decomposition
-
"syz(...,Strategy=>...)" -- see syz(Matrix) -- compute the syzygy matrix
-
"tangentCone(...,Strategy=>...)" -- see tangentCone(Ideal)