If is a polynomial in several variables, then there are a non-zero polynomial and a differential operator with polynomial coefficients such that
The Bernstein–Sato polynomial is the monic polynomial of smallest degree amongst such polynomials . Its existence can be shown using the notion of holonomic D-modules.
Kashiwara (1976) proved that all roots of the Bernstein–Sato polynomial are negative rational numbers.
The Bernstein–Sato polynomial can also be defined for products of powers of several polynomials. In this case it is a product of linear factors with rational coefficients.[citation needed]
The Bernstein–Sato polynomial can be computed algorithmically. However, such computations are hard in general. There are implementations of related algorithms in computer algebra systems RISA/Asir, Macaulay2, and SINGULAR.
DanielAndres,Viktor Levandovskyy,andJorge Martín-Morales(2009) presented algorithms to compute the Bernstein–Sato polynomial of an affine variety together with an implementation in the computer algebra system SINGULAR. ChristineBerkeschandAnton Leykin(2010) described some of the algorithms for computing Bernstein–Sato polynomials by computer.
Examples
If then
so the Bernstein–Sato polynomial is
If then
so
The Bernstein–Sato polynomial of x2+y3 is
If tij are n2 variables, then the Bernstein–Sato polynomial of det(tij) is given by
It may have poles whenever b(s+n) is zero for a non-negative integer n.
If f(x) is a polynomial, not identically zero, then it has an inverse g that is a distribution; in other words, fg=1 as distributions. If f(x) is non-negative the inverse can be constructed using the Bernstein–Sato polynomial by taking the constant term of the Laurent expansion of f(x)s at s=−1. For arbitrary f(x) just take times the inverse of
The Bernstein-Sato functional equation is used in computations of some of the more complex kinds of singular integrals occurring in quantum field theory. Such computations are needed for precision measurements in elementary particle physics as practiced for instance at CERN (see the papers citing). However, the most interesting cases require a simple generalization of the Bernstein-Sato functional equation to the product of two polynomials , with x having 2-6scalar components, and the pair of polynomials having orders 2 and 3. Unfortunately, a brute force determination of the corresponding differential operators and for such cases has so far proved prohibitively cumbersome. Devising ways to bypass the combinatorial explosion of the brute force algorithm would be of great value in such applications.
Notes
↑Warning: The inverse is not unique in general, because if f has zeros then there are distributions whose product with f is zero, and adding one of these to an inverse of f is another inverse of f.
↑Coutinho, Severino C. (1995). A primer of algebraic D-modules. London Mathematical Society Student Texts. Vol.33. Cambridge, UK: Cambridge University Press. ISBN0-521-55908-1.
↑Deligne, Pierre, ed. (2000), Quantum fields and strings: a course for mathematicians. Vol. 1, Institute for Advanced Study (2. Nachdr.ed.), Providence, RI: American Mathematical Society [u.a.], ISBN978-0-8218-2012-4