Related papers: An algorithm for annihilator and Bernstein-Sato po…
The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function,…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…
Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…
The Bernstein-Sato polynomial is an important invariant of an element or an ideal in a polynomial ring or power series ring of characteristic zero, with interesting connections to various algebraic and topological aspects of the…
This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We discuss more details on proofs, present new algorithms and examples. We present a general algorithm for…
We introduce the notion of Bernstein-Sato polynomial of an arbitrary variety (which is not necessarily reduced nor irreducible), using the theory of V-filtrations of M. Kashiwara and B. Malgrange. We prove that the decreasing filtration by…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
We compute Bernstein-Sato polynomials of some pairs of topologically equivalent plane curve singularities. Some pairs have the same Tjurina number but distinct Bernstein-Sato polynomials, which implies that they are not analytically…
For an ideal of a regular $\cc$-algebra, its Bernstein-Sato polynomial is the monic polynomial of the lowest degree satisfying an Bernstein-Sato functional equation. We generalize the notion of Bernstein-Sato functional equations to the…
In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.
We show that the Bernstein-Sato polynomial (that is, the b-function) of a hyperplane arrangement with a reduced equation is calculable by combining a generalization of Malgrange's formula with the theory of Aomoto complexes due to Esnault,…
Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…
This is the second part of a work dedicated to the study of Bernstein-Sato polynomials for several analytic functions depending on parameters. In this part, we give constructive results generalizing previous ones obtained by the author in…
Given $p$ polynomials with coefficients in a commutative unitary integral ring $\mathcal{C}$ containing $\mathbb{Q}$, we define the notion of a generic Bernstein-Sato polynomial on an irreducible affine scheme $V \subset…
We give an introduction to a theory of b-functions, i.e. Bernstein-Sato polynomials. After reviewing some facts from D-modules, we introduce b-functions including the one for arbitrary ideals of the structure sheaf. We explain the relation…
Given $p$ polynomials of $n$ variables over a field $k$ of characteristic 0 and a point $a \in k^n$, we propose an algorithm computing the local Bernstein-Sato ideal at $a$. Moreover with the same algorithm we compute a constructible…
We compute the Bernstein-Sato polynomial of $f$, a function which given a pair $(M,v)$ in $X = M_n(\mathbf{C}) \times \mathbf{C}^n$ tests whether $v$ is a cyclic vector for $M$. The proof includes a description of shift operators…
The Bernstein-Sato polynomial, or the $b$-function, is an important invariant of singularities of hypersurfaces that is difficult to compute in general. We describe a few different results towards computing the $b$-function of the…
Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier…