On the distribution of simple zeros of polynomials

Erd s and Turán discussed in (Ann. of Math. 41 (1940), 162–173; 51 (1950), 105–119) the distribution of the zeros of monic polynomials if their Chebyshev norm on [−1, 1] or on the unit disk is known. We sharpen this result to the case that all zeros of the polynomials are simple. As applications, estimates for the distribution of the zeros of orthogonal polynomials and the distribution of the alternation points in Chebyshev polynomial approximation are given. This last result sharpens a well-known error bound of Kadec (Amer. Math. Soc. Transl. 26 (1963), 231–234).     

On the zeros of polynomials

In this paper we extend a classical result due to Cauchy and its improvement due to Datt and Govil to a class of lacunary type polynomials.     

More zeros of krawtchouk polynomials

Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families inq are found for the degree three polynomials. The techniques used are from elementary number theory.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

Enclosing clusters of zeros of polynomials

Lagrange interpolation and partial fraction expansion can be used to derive a Gerschgorin-type theorem that gives simple and powerful a posteriori error bounds for the zeros of a polynomial if approximations to all zeros are available. Compared to bounds from a corresponding eigenvalue problem, a factor of at least two is gained.The accuracy of the bounds is analyzed, and special attention is given to ensure that the bounds work well not only for single zeros but also for multiple zeros and clusters of close zeros.A Rouché-type theorem is also given, that in many cases reduces the bound even further.     

On the zeros of Meixner polynomials

We investigate the zeros of a family of hypergeometric polynomials $M_n(x;\beta ,c)=(\beta )_n\,{}_2F_1(-n,-x;\beta ;1-\frac{1}{c})$ , $n\in \mathbb N ,$ known as Meixner polynomials, that are orthogonal on $(0,\infty )$ with respect to a discrete measure for $\beta >0$ and $0<c<1.$ When $\beta =-N$ , $N\in \mathbb N $ and $c=\frac{p}{p-1}$ , the polynomials $K_n(x;p,N)=(-N)_n\,{}_2F_1(-n,-x;-N;\frac{1}{p})$ , $n=0,1,\ldots , N$ , $0<p<1$ are referred to as Krawtchouk polynomials. We prove results for the zero location of the orthogonal polynomials $M_n(x;\beta ,c)$ , $c<0$ and $n<1-\beta $ , the quasi-orthogonal polynomials $M_n(x;\beta ,c)$ , $-k<\beta <-k+1$ , $k=1,\ldots ,n-1$ and $0<c<1$ or $c>1,$ as well as the polynomials $K_{n}(x;p,N)$ with non-Hermitian orthogonality for $0<p<1$ and $n=N+1,N+2,\ldots $ . We also show that the polynomials $M_n(x;\beta ,c)$ , $\beta \in \mathbb R $ are real-rooted when $c\rightarrow 0$ .     

The location of zeros of polynomials

Let A be a complex n×n matrix. p an equilibrated vectonal norm and x(A) the spectrial abscissa of A. Then, it is known [5] x(A)≤x(γ_p(A)) where γp is the matricial logarithmic derivative induced by p. We will make use of the above inequality to obtain regions in the plane which contain the zeros of complex polynomials.     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Structure of the zeros ofq-Bernoulli polynomials

In this paper we observe the structure of the roots ofq-Bernoulli polynomials,β _n (w, h|q), using numerical investigation. By numerical experiments, we demonstrate a remarkably regular structure of the real roots ofβ _n (w, h|q) forq=?1/5, ?1/2. Finally, we give a table for numbers of real and complex zeros ofβ _n (w, h|q).     

Maps preserving zeros of matrix polynomials

We study non-linear maps on the set of n × n matrices over a field, which preserve the zeros of a fixed homogeneous multilinear polynomial. This solves Kaplansky-Watkins problem from 1976 about the structure of such transformations. Published in Russian in Doklady Akademii Nauk, 2009, Vol. 427, No. 3, pp. 300–302. Presented by Academician A.T. Fomenko December 8, 2008 The article was translated by the authors.     

On the zeros of exponential polynomials

Suppose r = (r₁, …, r_M), r_j ? 0, γ_kj ? 0 integers, k = 1, 2, …, N, j = 1, 2, …, M, γ_k · r = ∑_jγ_kjr_j. The purpose of this paper is to study the behavior of the zeros of the function h(λ, a, r) = 1 + ∑_{j = 1}^Na_je^{?λγ_j · r}, where each a_j is a nonzero real number. More specifically, if $\text{Z}\text{?}\text{(a, r) =}\text{closure}\text{{}\text{Re}\text{λ: h(λ, a, r) = 0}}$, we study the dependence of $\text{Z}\text{?}\text{(a, r)}\text{on}\text{a, r}$. This set is continuous in a but generally not in r. However, it is continuous in r if the components of r are rationally independent. Specific criterion to determine when $\text{0 ?}\text{Z}\text{?}\text{(a, r)}$ are given. Several examples illustrate the complicated nature of $\text{Z}\text{?}\text{(a, r)}$. The results have immediate implication to the theory of stability for difference equations x(t) ? ∑_{k = 1}^MA_kx(t ? r_k) = 0, where x is an n-vector, since the characteristic equation has the form given by h(λ, a, r). The results give information about the preservation of stability with respect to variations in the delays. The results also are fundamental for a discussion of the dependence of solutions of neutral differential difference equations on the delays. These implications will appear elsewhere.     

Non-real zeros of linear differential polynomials

Let f be a real entire function with finitely many non-real zeros, not of the form f = Ph with P a polynomial and h in the Laguerre-Pólya class. Lower bounds are given for the number of non-real zeros of f″ + ω f, where ω is a positive real constant.     

Unimodularity of zeros of self-inversive polynomials

We generalise a necessary and sufficient condition given by Cohn for all the zeros of a self-inversive polynomial to be on the unit circle. Our theorem implies some sufficient conditions found by Lakatos, Losonczi and Schinzel. We apply our result to the study of a polynomial family closely related to Ramanujan polynomials, recently introduced by Gun, Murty and Rath, and studied by Murty, Smyth and Wang as well as by Lalín and Rogers. We prove that all polynomials in this family have their zeros on the unit circle, a result conjectured by Lalín and Rogers on computational evidence.     

Monotonicity of zeros of Laguerre polynomials

Denote by x_nk(α), k=1,…,n, the zeros of the Laguerre polynomial . We establish monotonicity with respect to the parameter α of certain functions involving x_nk(α). As a consequence we obtain sharp upper bounds for the largest zero of .     

Bi-orthogonality and zeros of transformed polynomials

Let D and E be two real intervals. We consider transformations that map polynomials with zeros in D into polynomials with zeros in E. A general technique for the derivation of such transformations is presented. It is based on identifying the transformation with a parametrised distribution φ (x, µ), x ∈ E, µ ∈ D, and forming the bi-orthogonal polynomial system with respect to φ. Several examples of such transformations are given.     

On the zeros of certain polynomials

We prove that certain naturally arising polynomials have all of their roots on a vertical line.