Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials

DOI10.1016/J.JSC.2005.05.004zbMATH Open1120.68404OpenAlexW1995850171MaRDI QIDQ2456589FDOQ2456589

Authors: María Isabel Hartillo Hermoso, J. M. Ucha, J. Gago 

Publication date: 19 October 2007

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

Full work available at URL: https://idus.us.es/xmlui/handle/11441/23600

Recommendations

• Computer Algebra in Scientific Computing
• On the computation of Bernstein-Sato ideals.
• Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
• Algorithms for Bernstein-Sato polynomials and multiplier ideals
• Local Bernstein-Sato ideals: algorithm and examples

zbMATH Keywords

complexityBernstein-Sato idealsrunning timesPoincaré-Birkhoff-Witt algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Rings of differential operators (associative algebraic aspects) (16S32) Ordinary and skew polynomial rings and semigroup rings (16S36) Computational aspects of associative rings (general theory) (16Z05) Sheaves of differential operators and their modules, (D)-modules (32C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Module Structure of Weyl Algebras
• Constructions in Algebra
• An algorithm for de Rham cohomology groups of the complement of an affine variety via \(D\)-module computation
• An algorithm of computing \(b\)-functions
• The analytic continuation of generalized functions with respect to a parameter
• Title not available (Why is that?)
• Title not available (Why is that?)
• Démonstration constructive de l'existence de polynômes de Bernstein–Sato pour plusieurs fonctions analytiques
• Title not available (Why is that?)
• On the computation of Bernstein-Sato ideals.
• Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
• Title not available (Why is that?)

Cited In (6)

• Combinatorially determined zeroes of Bernstein--Sato ideals for tame and free arrangements
• Constructive \(D\)-module theory with \texttt{Singular}
• Computing holonomic D-modules associated to a family of non-isolated hypersurface singularities via comprehensive Gröbner systems of PBW algebra
• Local Bernstein-Sato ideals: algorithm and examples
• Algebraic analysis of Siersma's non-isolated hypersurface singularities
• Computer Algebra in Scientific Computing

Uses Software

• Plural
• SINGULAR

This page was built for publication: Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials

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