- Usage:
`mI = multiplierIdeal(I,c)`

- Function: multiplierIdeal
- Inputs:
`I`, an ideal, an ideal in a polynomial ring`c`, a rational number, coefficient (or a list of coefficients)

- Optional inputs:
- DegreeLimit => ..., -- multiplier ideal
- Strategy => ..., -- multiplier ideal

- Outputs:
`mI`, an ideal, multiplier ideal*J_I(c)*(or a list of)

Computes the multiplier ideal for given ideal and coefficient.

There are three options for**ViaElimination**-- the default;**ViaLinearAlgebra**-- skips one expensive elimination step by using linear algebra;**ViaColonIdeal**-- same as elimination, but may be slightly faster.

i1 : R = QQ[x_1..x_4]; |

i2 : multiplierIdeal(ideal {x_1^3 - x_2^2, x_2^3 - x_3^2}, 31/18) 2 2 o2 = ideal (x , x , x x , x ) 3 2 1 2 1 o2 : Ideal of R |

When **Strategy=>ViaLinearAlgebra** the option **DegreeLimit** must be specified. The output it guaranteed to be the whole multiplier ideal only when dim(I)=0. For positive-dimensional input the up-to-specified-degree part of the multiplier ideal is returned.

- jumpingCoefficients -- jumping coefficients and corresponding multiplier ideals