Related papers: An algorithm for annihilator and Bernstein-Sato po…
In 1982, Tamaki Yano proposed a conjecture predicting the set of b-exponents of an irreducible plane curve singularity germ which is generic in its equisingularity class. In \cite{ACLM-Yano2} we proved the conjecture for the case in which…
We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…
In this work a rationalized algorithm for calculating the quotient of two complex numbers is presented which reduces the number of underlying real multiplications. The performing of a complex number division using the naive method takes 4…
Quantifier elimination over the reals is a central problem in computational real algebraic geometry, polynomial system solving and symbolic computation. Given a semi-algebraic formula (whose atoms are polynomial constraints) with…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
This is an expository survey on the theory of Bernstein-Sato polynomials with special emphasis in its recent developments and its importance in commutative algebra.
We prove a conjecture of the first author relating the Bernstein-Sato ideal of a finite collection of multivariate polynomials with cohomology support loci of rank one complex local systems. This generalizes a classical theorem of Malgrange…
We prove the multiplicative Thom-Sebastiani rule for Bernstein-Sato polynomials, answering the longstanding questions of Budur and Popa. We generalize the result to the tensor of two effective divisors on the product of two arbitrary…
The Bernstein-B\'ezier form of a polynomial is widely used in the fields of computer aided geometric design, spline approximation theory and, more recently, for high order finite element methods for the solution of partial differential…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
In this paper we compute b-functions (or Bernstein-Sato polynomials) of various semi-invariants of quivers. The main tool is an explicit relation for the b-functions between semi-invariants that correspond to each other under reflection…
We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
A quantum algorithm to solve the parity problem is better than its most efficient classical counter- part with a separation that is polynomial in the number of queries. This was shown by E. Bernstein and U. Vazirani and was one of the…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
Given two holomorphic functions $f$ and $g$ defined in two respective germs of complex analytic manifolds $(X,x)$ and $(Y,y)$, we know thanks to M. Saito that, as long as one of them is Euler homogeneous, the reduced (or microlocal)…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
We consider the Bernstein--Sato polynomial of a locally quasi-homogeneous polynomial $f \in R = \mathbb{C}[x_{1}, x_{2}, x_{3}]$. We construct, in the analytic category, a complex of $\mathscr{D}_{X}[s]$-modules that can be used to compute…
Musta\c{t}\u{a} defined Bernstein-Sato polynomials in prime characteristic for principal ideals and proved that the roots of these polynomials are related to the $F$-jumping numbers of the ideal. This approach was later refined by Bitoun.…