Algorithms for computing multiplier ideals

Takafumi Shibuta

    Research output: Contribution to journalArticle

    3 Citations (Scopus)


    We give algorithms for computing multiplier ideals using Gröbner bases in Weyl algebras. To this end, we define a modification of Budur-MustaǍǎ-Saito's generalized Bernstein-Sato polynomial. We present several examples computed by our algorithm.

    Original languageEnglish
    Pages (from-to)2829-2842
    Number of pages14
    JournalJournal of Pure and Applied Algebra
    Issue number12
    Publication statusPublished - Dec 1 2011


    All Science Journal Classification (ASJC) codes

    • Algebra and Number Theory

    Cite this