Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.

DOI10.1006/JSCO.2001.0487MaRDI QIDQ5960297zbMATH OpenOpenAlexFDO

Authors Rouchdi Bahloul

Publication date 15 April 2002

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.2001.0487

zbMATH Keywords

functional equationsgeneratorspolynomial mappingsideals

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Rings of differential operators (associative algebraic aspects) (16S32)

Recommendations

• Local Bernstein-Sato ideals: algorithm and examples
• Principal intersection and Bernstein-Sato polynomial of an affine variety
• Algorithms for Bernstein-Sato polynomials and multiplier ideals
• On the computation of Bernstein-Sato ideals.
• scientific article; zbMATH DE number 1380820

Cites work

• scientific article; zbMATH DE number 4027871 (Why is no real title available?)
• scientific article; zbMATH DE number 3786948 (Why is no real title available?)
• scientific article; zbMATH DE number 3482682 (Why is no real title available?)
• An algorithm for de Rham cohomology groups of the complement of an affine variety via D-module computation
• An algorithm of computing \(b\)-functions
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Polynômes de Bernstein-Sato associés à une intersection complète quasi-homogène à singularité isolée
• The analytic continuation of generalized functions with respect to a parameter

Cited in

(11)

• On the computation of Bernstein-Sato ideals.
• Bernstein-Sato Polynomials in Commutative Algebra
• Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
• ON A BERNSTEIN–SATO POLYNOMIAL OF A MEROMORPHIC FUNCTION
• Local Bernstein-Sato ideals: algorithm and examples
• On Bernstein–Sato ideals for central line arrangements
• Constructibility of the set of polynomials with a fixed Bernstein-Sato polynomial: an algorithmic approach.
• Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
• scientific article; zbMATH DE number 913116 (Why is no real title available?)
• Principal intersection and Bernstein-Sato polynomial of an affine variety
• Computer Algebra in Scientific Computing

This page was built for publication: Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.

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