On the zeros of a polynomial

For a polynomial of degree n, we have obtained an upper bound involving coefficients of the polynomial, for moduli of its p zeros of smallest moduli, and then a refinement of the well-known Eneström-Kakeya theorem (under certain conditions).     

The location of the zeros of the higher order derivatives of a polynomial

Let be a complex polynomial of degree having zeros in a disk . We deal with the problem of finding the smallest concentric disk containing zeros of . We obtain some estimates on the radius of this disk in general as well as in the special case, where zeros in are isolated from the other zeros of . We indicate an application to the root-finding algorithms.

     

On the zeros of a polynomial and its derivatives

If is univariate polynomial with complex coefficients having all its zeros inside the closed unit disk, then the Gauss-Lucas theorem states that all zeros of lie in the same disk. We study the following question: what is the maximum distance from the arithmetic mean of all zeros of to a nearest zero of ? We obtain bounds for this distance depending on degree. We also show that this distance is equal to for polynomials of degree 3 and polynomials with real zeros.

     

On the coefficients of a polynomial with restricted zeros

LetP(Z)=αn Zn + αn-1Zn-1 +…+α0 be a complex polynomial of degree n. There is a close connection between the coefficients and the zeros of P(z). In this paper we prove some sharp inequalities concerning the coeffi-cients of the polynomial P(z) with restricted zeros. We also establish a sufficient condition for the separation of zeros of P(z).     

On Cauchy's bound for zeros of a polynomial

In this paper we have improved Cauchy's bound for zeros of a polynomialp(z)=z ⁿ+a _n+1 z ^n-1+a _n-2 z ^n-2+......+a ₁ z+a ₀. Our result is best possible and sharpens some other results also.     

On a generalized homogeneous Hahn polynomial

We investigate a generalized homogeneous Hahn polynomial in some detail. This polynomial includes as special cases the homogeneous Hahn polynomial and the homogeneous Rogers-Szeg o polynomial.A generating function, which contains a known generating function as a special case, is given. We also give a finite series generating function. Some results on the asymptotic expansion for this polynomial are derived.Certain results on zeros are also obtained. We deduce several results on zeros of certain ...     

On the generalized Euler-Frobenius polynomial

In this paper, the properties of the generalized Euler-Frobenius polynomial Π_n(·, q) are studied. It is proved that its zeroes are separated by the factor q and their asymptotic behavior, as q → ∞, is given. As a consequence, it is shown that least squares spline approximation on a biinfinite geometric mesh can be bounded independently of the (local) mesh ratio q and that the norm of the inverse of the corresponding order kB-spline Gram matrix decreases monotonically to 2k − 1 for large q, as q → ∞.     

On the zeros of generalized Airy functions

We investigate the behaviour with respect to the parameter > 0 of the zeros of the solutions of the differential equation y+y=0. We show that under appropriate restrictions such zeros are logconvex.Work sponsored by CNR, Gruppo Nazionale per l'Informatica Matematica, of Italy.     

On the distribution of the number of real zeros of a random polynomial

In this note, we find the distibution of the number of real zeros of a random polynomial. We also derive a formula for the expected number of complex zeros lying in a given domain of the complex plane. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 320, 2004, pp. 69–79.     

Simultaneous inclusion of the zeros of a polynomial

Summary A family of inclusion sets for the zeros of a complex polynomial is derived from the Lagrangean interpolation formulas. The optimization of the inclusion leads to a special type of matrix eigenvalue problem previously considered by several authors in connection with minimal Gershgorin discs.     

On the generalized critical values of a polynomial mapping

 Let be a polynomial dominant mapping and let deg f _i ≤d. We prove that the set K(f) of generalized critical values of f is contained in the algebraic hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ , where . This implies in particular that the set B(f) of bifurcations points of f is contained in the hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ . We give also an algorithm to compute the set K(f) effectively. Received: 11 June 2001 / Revised version: 1 July 2002 Published online: 24 January 2003 The author is partially supported by the KBN grant 2 PO3A 017 22. Mathematics Subject Classification (2000): 14D06, 14Q20, 51N10, 51N20, 15A04     

On zeros of the Alexander polynomial of an alternating knot

We prove that for any zero α of the Alexander polynomial of a two-bridge knot, −3<Re(α)<6. Furthermore, for a large class of two-bridge knots we prove −1<Re(α).     

On the computation of the generalized inverse of a polynomial matrix

The main purpose of this paper is to present a quicker and less memory-expensive algorithm for the generalized inversionof polynomial matrices than those presented earlier (Karampetakis,1997a Computation of the generalized inverse of a polynomialmatrix and applications. Linear Algebr. Appl. 252, 35–60 and Karampetakis, 1997b Generalized inverses of two variable polynomial matrices and applications. Circuit Syst. & Signal Process. 16, 439–453). Received 24 January, 1999. ⁺ karampetakis@ccf.auth.gr