Algorithms for computing multiplier ideals

Details Algorithms for computing multiplier ideals Algorithms for computing multiplier ideals

2008-07-28

arxiv.org/abs/0807.4302v6

Mathematics

Algebraic Geometry

23 pages, title changed, Theorem 4.5 added, typos corrected, and some minor revisions (some notation changed, and Definition 2

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Algorithms for computing multiplier ideals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for computing multiplier ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for computing multiplier ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312486