Algorithms for computing multiplier ideals

DOI10.1016/J.JPAA.2011.04.002zbMATH Open1233.14015arXiv0807.4302OpenAlexW2170292350MaRDI QIDQ649844FDOQ649844

Takafumi Shibuta

Publication date: 6 December 2011

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: We give algorithms for computing multiplier ideals using Gr"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Mustac{t}v{a}--Saito's (generalized) Bernstein--Sato polynomial. We present several examples computed by our algorithms.

Full work available at URL: https://arxiv.org/abs/0807.4302

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]Weyl algebramultiplier ideal\(\mathcal D\)-moduleslog resolution

Mathematics Subject Classification ID

Differentials and other special sheaves; D-modules; Bernstein-Sato ideals and polynomials (14F10) Multiplier ideals (14F18) Computational aspects of higher-dimensional varieties (14Q15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bernstein–Sato polynomials of arbitrary varieties
• Singularities of Pairs
• Modules de Hodge polarisables. (Polarisable Hodge modules)
• Mixed Hodge modules
• Gröbner deformations of hypergeometric differential equations
• Jumping coefficients of multiplier ideals
• Algorithms for \(D\)-modules -- restriction, tensor product, localization, and local cohomology groups
• Algorithms for the \(b\)-function and \(D\)-modules associated with a polynomial
• Algorithms for \(b\)-functions, restrictions, and algebraic local cohomology groups of \(D\)-modules
• Multiplier ideals of monomial ideals
• An algorithm of computing \(b\)-functions
• MULTIPLICITY ONE PROPERTY AND THE DECOMPOSITION OF b-FUNCTIONS

Cited In (22)

• An algorithm for Hodge ideals
• A simple algorithm for principalization of monomial ideals
• Log canonical thresholds of binomial ideals
• Constructive \(D\)-module theory with \texttt{Singular}
• Multiplier ideals of plane curve singularities via Newton polygons
• On Fulton’s Algorithm for Computing Intersection Multiplicities
• Software for multiplier ideals
• Improving the DISPGB algorithm using the discriminant ideal
• Bernstein–Sato functional equations, V-filtrations, and multiplier ideals of direct summands
• The monodromy conjecture for zeta functions associated to ideals in dimension two
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm to compute abelian subalgebras and ideals in Malcev algebras
• Title not available (Why is that?)
• Monomial generators of complete planar ideals
• Jumping coefficients of multiplier ideals
• A prolongation-projection algorithm for computing the finite real variety of an ideal
• Computing jumping numbers in higher dimensions
• Valuation spaces and multiplier ideals on singular varieties
• A symbolic algorithm for parameterizing a prime ideal
• Algorithms for Minkowski products and implicitly-defined complex sets

Uses Software

• Risa/Asir
• Kan

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithms for strongly stable ideals 👍 👎
• NUMERICAL ALGORITHMS FOR DUAL BASES OF POSITIVE-DIMENSIONAL IDEALS 👍 👎
• Computation in polynomial algebras and ideals 👍 👎
• Algorithms for Bernstein--Sato polynomials and multiplier ideals 👍 👎
• On the Stickelberger Ideal and Circular Units of a Compositum of Quadratic Fields 👍 👎
• Computing Multiplier Ideals in Smooth Surfaces 👍 👎

This page was built for publication: Algorithms for computing multiplier ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649844)