cycleIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
Synopsis
-
- Usage:
cycleIdeal(..., Strategy => Iterate)cycleIdeal(..., Strategy => Bayer)cycleIdeal(..., Strategy => Linear)cycleIdeal(..., Strategy => Eliminate)
Further information
-
Default value: Eliminate
-
Function: cycleIdeal -- constructs the cycle ideal of a realization
-
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
-
adjoint(...,Strategy=>...) (missing documentation)
-
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
-
canonicalBundle(...,Strategy=>...) (missing documentation)
-
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
-
cotangentSheaf(...,Strategy=>...) (missing documentation)
-
cycleIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
-
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=>...)
-
dual(SheafMap,Strategy=>...) (missing documentation)
-
End(...,Strategy=>...) -- see End -- module of endomorphisms
-
epicResolutionMap(...,Strategy=>...) (missing documentation)
-
exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
-
gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
-
gcdLLL(...,Strategy=>...) (missing documentation)
-
GF(...,Strategy=>...) -- see GF -- make a finite field
-
graphicIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
-
grassmannSectionIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
-
greeneKleitmanPartition(...,Strategy=>...) -- see greeneKleitmanPartition -- computes the Greene-Kleitman partition of a poset
-
groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
-
hasMinor(...,Strategy=>...) -- see hasMinor -- whether a matroid has a given minor
-
hermite(...,Strategy=>...) (missing documentation)
-
hibiRing(...,Strategy=>...) -- see hibiRing -- produces the Hibi ring of a poset
-
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
-
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
-
lcmLattice(...,Strategy=>...) -- see lcmLattice -- generates the lattice of lcms in an ideal
-
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, Cofactor and Dynamic algorithms
-
parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
-
pPartitionRing(...,Strategy=>...) -- see pPartitionRing -- produces the p-partition ring of a poset
-
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
-
associatedGradedRing(...,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(Ideal,RingElement,Strategy=>...) -- see reesIdeal(...,Strategy=>...) -- Choose a strategy for the saturation step
-
normalCone(Ideal,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
-
rehomogenizeIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
-
resolution(...,Strategy=>...)
-
resolutionMap(...,Strategy=>...) -- see resolutionMap -- map from a free resolution to the given complex
-
saturate(...,Strategy=>...)
-
sheafHom(...,Strategy=>...) (missing documentation)
-
slackIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
-
primaryDecomposition(...,Strategy=>...) -- see strategies for computing primary decomposition
-
freeResolution(...,Strategy=>...) -- see Strategies for free resolutions -- overview of the different algorithms for computing free resolutions
-
syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix
-
tangentCone(...,Strategy=>...) -- see tangentCone(Ideal)
-
tangentSheaf(...,Strategy=>...) (missing documentation)
-
transitiveOrientation(...,Strategy=>...) -- see transitiveOrientation -- generates a poset whose comparability graph is the given graph