Related papers: A note on the location of polynomial roots

The most frequently asked question in the $p-$adic lattice models of statistical mechanics is that whether a root of a polynomial equation belongs to domains $\mathbb{Z}_p^{*}, \ \mathbb{Z}_p\setminus\mathbb{Z}_p^{*}, \ \mathbb{Z}_p, \…

Previous analyses of Laguerre's method have provided results on the convergence and properties of this popular method when applied to the polynomials $p_n(z)=z^n-1$, $n\in\mathbb{N}$. While these analyses appear to provide a fairly complete…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…

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…

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.

Let $p:\mathbb{C} \rightarrow \mathbb{C}$ be a polynomial. The Gauss-Lucas theorem states that its critical points, $p'(z) = 0$, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows:…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

We obtain new partial results supporting the spectral set conjecture in dimension 1.

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

The Gauss-Lucas theorem says that for any complex polynomial $P$, the roots of the derivative $P'$ lie in the convex hull of the roots of $P$. In other words, the roots of $P'$ lie inside the smallest convex subset of the complex plane…

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

We consider polynomial approximations of z-bar to better understand the torsional rigidity of polygons. Our main focus is on low degree approximations and associated extremal problems that are analogous to Polya's conjecture for torsional…

Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…

The Sendovs conjecture asserts that if all the zeros of a polynomial p(z) lie in the closed unit disk, then there must be a critical point of p(z) within unit distance of each zero. The conjecture has been proved to be true for many special…

We introduce a canonical notion of entropy for polynomials analogue to that of random variables in probability. We prove that entropy increases smoothly with respect to finite free addition. In particular we get the new inequality : $…

We derive various bounds for the $L_p$ distance of polynomials on the hypercube from Walsh tail spaces, extending some of Oleszkiewicz's results (2017) for Rademacher sums.