Related papers: The root distribution of polynomials with a three-…

We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

We determine the probability that a random polynomial of degree $n$ over $\mathbb{Z}_p$ has exactly $r$ roots in $\mathbb{Q}_p$, and show that it is given by a rational function of $p$ that is invariant under replacing $p$ by $1/p$.

Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…

In this paper, we prove optimal local universality for roots of random polynomials with arbitrary coeffcients of polynomial growth. As an application, we derive, for the first time, sharp estimates for the number of real roots of these…

For fixed prime integer $p > 0$ we develop a notion of Bernstein-Sato polynomial for polynomials with $\mathbb{Z} / p^m$-coefficients, compatible with existing theory in the case $m = 1$. We show that the ``roots" of such polynomials are…

A conjecture of Khang Tran [6] claims that for an arbitrary pair of polynomials $A(z)$ and $B(z)$, every zero of every polynomial in the sequence $\{P_n(z)\}_{n=1}^\infty$ satisfying the three-term recurrence relation of length $k$…

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the…

We investigate the roots of Hilbert quasipolynomials arising from certain rational generating functions.