Local Bernstein-Sato ideals: algorithm and examples
From MaRDI portal
Abstract: Given polynomials of variables over a field of characteristic 0 and a point , we propose an algorithm computing the local Bernstein-Sato ideal at . Moreover with the same algorithm we compute a constructible stratification of such that the local Bernstein-Sato ideal is constant along each stratum. Finally, we present non-trivial examples computed with our algorithm.
Recommendations
- Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
- Algorithms for Bernstein-Sato polynomials and multiplier ideals
- On the computation of Bernstein-Sato ideals.
- Local generic Bernstein-Sato polynomial
- Algorithms for checking rational roots of b-functions and their applications
Cites work
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 4008805 (Why is no real title available?)
- scientific article; zbMATH DE number 3482682 (Why is no real title available?)
- Algorithm computing the local \(b\) function by an approximate division algorithm in \(\widehat{\mathcal D}\)
- Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
- Algorithms for \(b\)-functions, restrictions, and algebraic local cohomology groups of \(D\)-modules
- An algorithm for de Rham cohomology groups of the complement of an affine variety via D-module computation
- An algorithm of computing \(b\)-functions
- CONSTRUCTION D'UN ÉLÉMENT REMARQUABLE DE L'IDÉAL DE BERNSTEIN-SATO ASSOCIÉ À DEUX COURBES PLANES ANALYTIQUES
- Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
- Computational D-module theory with singular, comparison with other systems and two new algorithms
- Démonstration constructive de l'existence de polynômes de Bernstein–Sato pour plusieurs fonctions analytiques
- Generalized functional equations: transversality and principality of the Bernstein-Sato ideal
- On the computation of Bernstein-Sato ideals.
Cited in
(23)- On the computation of Bernstein-Sato ideals.
- Algorithms for Bernstein-Sato polynomials and multiplier ideals
- Combinatorially determined zeroes of Bernstein--Sato ideals for tame and free arrangements
- Constructive \(D\)-module theory with \texttt{Singular}
- Bernstein-Sato Polynomials in Commutative Algebra
- Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
- Algorithms for checking rational roots of b-functions and their applications
- ON A BERNSTEIN–SATO POLYNOMIAL OF A MEROMORPHIC FUNCTION
- Local systems on analytic germ complements
- Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.
- Bernstein-Sato varieties and annihilation of powers
- A note on Bernstein-Sato varieties for tame divisors and arrangements
- Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
- Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
- About an algorithm of T. Oaku.
- Local generic Bernstein-Sato polynomial
- Stratification associated with local \(b\)-functions
- Four examples of Beilinson–Bernstein localization
- Zero loci of Bernstein-Sato ideals
- Gröbner Bases in D-Modules: Application to Bernstein-Sato Polynomials
- Principal intersection and Bernstein-Sato polynomial of an affine variety
- Computer Algebra in Scientific Computing
- Bernstein-Sato ideals and local systems
This page was built for publication: Local Bernstein-Sato ideals: algorithm and examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034547)
