Algorithms for computing multiplier ideals
classification
🧮 math.AG
math.AC
keywords
algorithmscomputingidealsmultiplieralgebrasbasesbernstein--satobudur--musta
read the original 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--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial. We present several examples computed by our algorithms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.