An algorithm for annihilator and Bernstein-Sato polynomial of a rational function

The singularity theory of rational functions, i.e., the quotient of two polynomials, has been investigated in the past two decades. The Bernstein-Sato polynomial of a rational function has recently been introduced by Takeuchi. However, only trivial examples are known. We provide an algorithm for computing the Bernstein-Sato polynomial in this context. The strategy is to compute the annihilator of the rational function by using the annihilator of the pair consisting of the numerator and denominator of the quotient. In a natural way a non-vanishing condition on the Bernstein-Sato ideal of the pair appears. This method has been implemented in freely available computer algebra system SINGULAR. It relies on Gröbner bases in noncommutative PBW algebras. The algorithm allows us to exhibit some explicit non-trivial examples and to support some existing conjectures.

💡 Research Summary

The paper addresses the problem of computing the Bernstein‑Sato polynomial (also called the b‑function) for rational functions of the form (f/g), where (f) and (g) are non‑constant polynomials in (\mathbb{C}