Related papers: Experiments on the zeros of harmonic polynomials u…
The package \texttt{NumericalCertification} implements methods for certifying numerical approximations of solutions for a given system of polynomial equations. For certifying regular solutions, the package implements Smale's $\alpha$-theory…
In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…
We determine the asymptotics for the variance of the number of zeros of random linear combinations of orthogonal polynomials of degree $\leq n$ in subintervals $\left [ a,b\right ] $ of the support of the underlying orthogonality measure…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
We investigate the evolution of the empirical distribution of the complex roots of high-degree random polynomials, when the polynomial undergoes the heat flow. In one prominent example of Weyl polynomials, the limiting zero distribution…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
This article develops a new predictor-corrector algorithm for numerical path tracking in the context of polynomial homotopy continuation. In the corrector step it uses a newly developed Newton corrector algorithm which rejects an initial…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…
In this paper we investigate bounds for the zeros of a bicomplex polynomial using matrix method. In particular, we find analogue of Gershgorin disk theorem, Cauchy Theorem, theorem of Fujiwara, Walsh and other theorems concerning to zeros…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
Let $E$ be a compact set of positive logarithmic capacity in the complex plane and let $\{P_n(z)\}_{1}^{\infty}$ be a sequence of asymptotically extremal monic polynomials for $E$ in the sense that \begin{equation*}%\label{}…
This note presents the multivariate Hermite criterion: a practical and powerful algorithm for determining the number of distinct real and complex roots of a zero-dimensional system of polynomials in any finite number of variables. The final…
An active topic in the study of random constraint satisfaction problems (CSPs) is the geometry of the space of satisfying or almost satisfying assignments as the function of the density, for which a precise landscape of predictions has been…
Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…