Algorithm for computing local Bernstein-Sato ideals
Rouchdi Bahloul, Toshinori Oaku

TL;DR
This paper introduces an algorithm to compute local Bernstein-Sato ideals at a point and to stratify the space so that these ideals are constant on each stratum, demonstrated with non-trivial examples.
Contribution
The paper presents a novel algorithm for computing local Bernstein-Sato ideals and their stratification, advancing computational methods in algebraic analysis.
Findings
Successfully computes local Bernstein-Sato ideals at given points.
Provides a constructible stratification where ideals are constant.
Demonstrates the algorithm with complex, non-trivial examples.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Rings, Modules, and Algebras
