Related papers: An algorithm for annihilator and Bernstein-Sato po…

Let $f$ be a semi-weighted-homogeneous polynomial having an isolated singularity at 0. Let $\alpha_{f,k}$ be the spectral numbers of $f$ at 0. By Malgrange and Varchenko there are non-negative integers $r_k$ such that the $\alpha_{f,k}-r_k$…

Following work of Musta\c{t}\u{a} and Bitoun we recently developed a notion of Bernstein-Sato roots for arbitrary ideals, which is a prime characteristic analogue for the roots of the Bernstein-Sato polynomial. Here we prove that for…

An algorithm is presented that, taking a sequence of independent Bernoulli random variables with parameter $1/2$ as inputs and using only rational arithmetic, simulates a Bernoulli random variable with possibly irrational parameter $\tau$.…

For a central, not necessarily reduced, hyperplane arrangement $f$ equipped with any factorization $f = f_{1} \cdots f_{r}$ and for $f^{\prime}$ dividing $f$, we consider a more general type of Bernstein--Sato ideal consisting of the…

Cardinal's factorization algorithm of 1996 splits a univariate polynomial into two factors with root sets separated by the imaginary axis, which is an important goal itself and a basic step toward root-finding. The novelty of the algorithm…

The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

We present a method for solving polynomial equations over idempotent omega-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of interest, and only evaluate when needed. The key operation is…

As a continuum work of Bhaumik et al who derived the common eigenvector of the number-difference operator Q and pair-annihilation operator ab (J. Phys. A9 (1976) 1507) we search for the simultaneous eigenvector of Q and (ab-a^{+}b^{+}) by…

We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…

We study Saito duality and Fourier-Ramanujan transform for power sums and multiplicities of monodromy roots.

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

In 1987, C. Sabbah proved the existence of Bernstein-Sato polynomials associated with several analytic functions. The purpose of this article is to give a more elementary and constructive proof of the result of C. Sabbah based on the notion…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

In 2006, Budur, Musta\c{t}\v{a} and Saito introduced the notion of Bernstein-Sato polynomial of an arbitrary scheme of finite type over fields of characteristic zero. Because of the strong monodromy conjecture, it should have a…

In 1987, C. Sabbah proved the existence of Bernstein-Sato polynomials associated with several analytic functions. The purpose of this article is to give a more elementary and constructive proof of the result of C. Sabbah based on the notion…

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

Results on the rational approximation of functions containing singularities are presented. We build further on the ''lightning method'', recently proposed by Trefethen and collaborators, based on exponentially clustering poles close to the…

We present criteria for deciding whether a bivariate rational function in two variables can be written as a sum of two (q-)differences of bivariate rational functions. Using these criteria, we show how certain double sums can be evaluated,…