Related papers: Roots of random polynomials with coefficients havi…

We prove that the roots of a definable $C^\infty$ curve of monic hyperbolic polynomials admit a definable $C^\infty$ parameterization, where `definable' refers to any fixed o-minimal structure on $(\mathbb R,+,\cdot)$. Moreover, we provide…

We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

We consider real monic {\em hyperbolic} polynomials in one real variable, i.e. polynomials having only real roots. Call {\em hyperbolicity domain} $\Pi$ of the family of polynomials $P(x,a)=x^n+a_1x^{n-1}+... +a_n$, $a_i,x\in {\bf R}$, the…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

In this work, we study asymptotic zero distribution of random multi-variable polynomials which are random linear combinations $\sum_{j}a_jP_j(z)$ with i.i.d coefficients relative to a basis of orthonormal polynomials $\{P_j\}_j$ induced by…

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

In this paper the author considers a particular type of polynomials with integer coefficients, consisting of a perfect power and two norm forms of abelian number fields with coprime discriminants. It is shown that such a polynomial…

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

A universality conjecture of Farmer and Rhoades [Trans. Amer. Math. Soc., 357(9):3789--3811, 2005] and Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022] asserts that, under some natural conditions, the roots of an entire function should…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…