Pages that link to "Item:Q649844"

The following pages link to Algorithms for computing multiplier ideals (Q649844):

Displaying 21 items.

• Constructive \(D\)-module theory with \texttt{Singular} (Q541982) (← links)
• Log canonical thresholds of binomial ideals (Q836903) (← links)
• A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
• Algorithms for Minkowski products and implicitly-defined complex sets (Q1569745) (← links)
• Jumping coefficients of multiplier ideals (Q1880385) (← links)
• The monodromy conjecture for zeta functions associated to ideals in dimension two (Q1958976) (← links)
• Computing jumping numbers in higher dimensions (Q2285834) (← links)
• Improving the DISPGB algorithm using the discriminant ideal (Q2457398) (← links)
• Software for multiplier ideals (Q2515654) (← links)
• A symbolic algorithm for parameterizing a prime ideal (Q2713087) (← links)
• Algorithm to compute abelian subalgebras and ideals in Malcev algebras (Q2831034) (← links)
• On Fulton’s Algorithm for Computing Intersection Multiplicities (Q2914998) (← links)
• Valuation spaces and multiplier ideals on singular varieties (Q2949166) (← links)
• (Q3542151) (← links)
• (Q3789349) (← links)
• (Q4038758) (← links)
• Monomial generators of complete planar ideals (Q4988220) (← links)
• Bernstein–Sato functional equations, V-filtrations, and multiplier ideals of direct summands (Q5048644) (← links)
• An algorithm for Hodge ideals (Q5103766) (← links)
• A simple algorithm for principalization of monomial ideals (Q5313310) (← links)
• Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)