Related papers: Algorithms for Checking Rational Roots of $b$-func…

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

We prove some sufficient conditions in order that a root of the Bernstein-Sato polynomial contributes to a difference between certain D-modules generated by rational powers of a holomorphic function; for instance, this holds in the case of…

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…

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

For a nonzero ideal I of C[x_1,...,x_n], with 0 in supp I, a generalization of a conjecture of Igusa - Denef - Loeser predicts that every pole of its topological zeta function is a root of its Bernstein-Sato polynomial. However, typically…

We show that given an ideal I generated by regular functions f_1,...,f_r on the smooth complex variety X, the Bernstein-Sato polynomial of I is equal to the reduced Bernstein-Sato polynomial of the function g=\sum_{i=1}^rf_iy_i on the…

We show that the relation between multiplier ideals and $V$-filtration on the structure sheaf due to Budur-Musta\c{t}\u{a}-Saito generalizes to singular irreducible varieties, by replacing multiplier ideals with multiplier modules and the…

For strongly Euler-homogeneous, Saito-holonomic, and tame analytic germs we consider general types of multivariate Bernstein-Sato ideals associated to arbitrary factorizations of our germ. We show the zero loci of these ideals are purely…

Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees of…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…

We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree <q, has a root in F_q. A corollary of our method --- the first with complexity sub-linear…

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Let $p\in\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a…

We define an indicial polynomial of a $D$-module along an arbitrary subvariety as a generalization of both the classical indicial polynomial for a single linear differential equation and the Bernstein-Sato polynomial of a variety defined by…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…