Macaulay2 » Documentation
Packages » BernsteinSato :: DintegrationIdeal(...,Strategy=>...)
next | previous | forward | backward | up | index | toc

# DintegrationIdeal(...,Strategy=>...)

## Description

Option is passed to Dresolution. See Dresolution(...,Strategy=>...)

## 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
- `basis(...,Strategy=>...)` -- see basis -- basis or generating set of all or part of a ring, ideal or module
- bFunction(...,Strategy=>...) -- specify strategy for computing b-function
- `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
- decompose(Ideal,Strategy=>...) (missing documentation)
- deRham(...,Strategy=>...)
- deRhamAll(...,Strategy=>...)
- determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
- DExt(...,Strategy=>...)
- DHom(...,Strategy=>...)
- Dintegration(...,Strategy=>...)
- `DintegrationAll(...,Strategy=>...)`
- `DintegrationClasses(...,Strategy=>...)`
- `DintegrationComplex(...,Strategy=>...)`
- DintegrationIdeal(...,Strategy=>...)
- `Drestriction(...,Strategy=>...)`
- `DrestrictionAll(...,Strategy=>...)`
- `DrestrictionClasses(...,Strategy=>...)`
- `DrestrictionComplex(...,Strategy=>...)`
- `DrestrictionIdeal(...,Strategy=>...)`
- Dlocalize(...,Strategy=>...) -- strategy for computing a localization of a D-module
- `DlocalizeAll(...,Strategy=>...)` -- see Dlocalize(...,Strategy=>...) -- strategy for computing a localization of a D-module
- `DlocalizeMap(...,Strategy=>...)` -- see Dlocalize(...,Strategy=>...) -- strategy for computing a localization of a D-module
- Dresolution(...,Strategy=>...) -- strategy for computing a resolution of a D-module
- `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
- `gbw(...,Strategy=>...)` -- see gbw -- compute a Gröbner basis with respect to a weight vector
- generalB(...,Strategy=>...) -- specify strategy for computing generalized Bernstein-Sato polynomial
- `GF(...,Strategy=>...)` -- see GF -- make a finite field
- globalBFunction(...,Strategy=>...) -- specify strategy for computing global b-function
- `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
- `intersectionCohomology(...,Strategy=>...)` -- see intersectionCohomology -- intersection cohomology of an irreducible affine variety
- `isInMultiplierIdeal(...,Strategy=>...)` -- see isInMultiplierIdeal(RingElement,Ideal,QQ) -- multiplier ideal membership test
- isPrime(Ideal,Strategy=>...) (missing documentation)
- lct(...,Strategy=>...) -- specify strategy for computing lct
- localCohom(...,Strategy=>...) -- specify strategy for local cohomology
- `match(...,Strategy=>...)` -- see match -- regular expression matching
- minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
- `jumpingCoefficients(...,Strategy=>...)` -- see multiplierIdeal(Ideal,QQ) -- multiplier ideal
- `multiplierIdeal(...,Strategy=>...)` -- see multiplierIdeal(Ideal,QQ) -- multiplier ideal
- normalCone(Ideal,RingElement,Strategy=>...) (missing documentation)
- normalCone(Ideal,Strategy=>...) (missing documentation)
- `parallelApply(...,Strategy=>...)` -- see parallelApply -- apply a function to each element in parallel
- polynomialExt(...,Strategy=>...)
- `pushForward(...,Strategy=>...)` -- see pushForward(RingMap,Module) -- compute the pushforward of a module along a ring map
- quotient'(...,Strategy=>...) (missing documentation)
- quotient(...,Strategy=>...) (missing documentation)
- rationalFunctionExt(...,Strategy=>...)
- resolution(...,Strategy=>...)
- saturate(...,Strategy=>...) (missing documentation)
- `syz(...,Strategy=>...)` -- see syz(Matrix) -- compute the syzygy matrix

## Further information

- Default value: Schreyer
- Function: DintegrationIdeal -- integration ideal of a D-module
- Option key: Strategy -- an optional argument

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/BernsteinSato/DOC/Drestriction.m2:82:0.