betterNormalizationMap(...,Strategy=>...) -- controls what strategy is used in calls to integralClosure

Description

Further information

• Default value: {}
• Function: betterNormalizationMap -- normalizes non domains
• Option key: Strategy -- an optional argument

See also

• integralClosure(...,Strategy=>...) -- control the algorithm used

Functions with optional argument named Strategy :

• addHook(...,Strategy=>...) -- see addHook -- add a hook function to an object for later processing
• adjoint(...,Strategy=>...) (missing documentation)
• annihilator(...,Strategy=>...) -- see annihilator -- the annihilator ideal
• basis(...,Strategy=>...) -- see basis -- basis or generating set of all or part of a ring, ideal or module
• betterNormalizationMap(...,Strategy=>...) -- controls what strategy is used in calls to integralClosure
• seminormalize(...,Strategy=>...)
• mingens(...,Strategy=>...) -- see Complement -- a Strategy option value
• trim(...,Strategy=>...) -- see Complement -- a Strategy option value
• compose(Module,Module,Module,Strategy=>...) -- see compose -- composition as a pairing on Hom-modules
• determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• dual(ChainComplex,Strategy=>...) (missing documentation)
• dual(Matrix,Strategy=>...) (missing documentation)
• dual(MonomialIdeal,List,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,RingElement,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,Strategy=>...)
• End(...,Strategy=>...) -- see End -- module of endomorphisms
• exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
• GF(...,Strategy=>...) -- see GF -- make a finite field
• groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
• Hom(...,Strategy=>...) -- see Hom -- module of homomorphisms
• homomorphism'(...,Strategy=>...) -- see homomorphism' -- get the element of Hom from a homomorphism
• hooks(...,Strategy=>...) -- see hooks -- list hooks attached to a key
• 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
• isPrime(Ideal,Strategy=>...) -- see isPrime(Ideal) -- whether an ideal is prime
• match(...,Strategy=>...) -- see match -- regular expression matching
• decompose(Ideal,Strategy=>...) -- see minimalPrimes -- minimal primes of an ideal
• minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
• pushForward(...,Strategy=>...) (missing documentation)
• quotient(...,Strategy=>...)
• resolution(...,Strategy=>...)
• saturate(...,Strategy=>...)
• syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix