Cmjv01i04p0437

Page 1

J. Comp. & Math. Sci. Vol. 1(4), 437-442 (2010).

On the coefficients of a polynomial with restricted zeros M.S. PUKHTA Division of Agr. Engineering SK. University of Agricultural Sciences & Technology Kashmir, Srinagar, 191121, India e-mail: mspukhta_67@yahoo.co.in ABSTRACT Let be a polynomial of degree. There is a close connection between the coefficients and the zeros of . In this paper we prove some sharp inequalities concerning the coefficients of the polynomial with restricted zeros. We also establish a sufficient condition for the separation of zeros

.

Key Words : polynomial inequalities, Coefficient estimate, Sepapration of zeros. AMS ( 2000) Subject Classification: 30A64, 30C10, 30C15, 41A17

1. INTRODUCTION

when

Let P( z )  nj=0 a j z j be a polynomial of degree n. By a simple method Visser5 got:

is not too small.

Theorem A. Let

and

where e

, be any two coefficientss

(1.1)

of the polynomial P ( z)   nv=0 av z v such that for no other coefficients do we have . Then

Corput and Visser 1 generalized the inequality (1.1) by proving the following

(1 .2)

sharp estimate for

In this case Rahman 4 proved the

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)


438

M.S. Pukhta, J.Comp.&Math.Sci. Vol.1(4), 437-442 (2010)

following more general result:

and equality holds for

Theorem B. Let P ( z)   nv=0 av z v and Q( z )  n=0 b z  where

.

Suppose in addition that for

. If

for

, then (1 .3)

Concerning the inequalities involving three coefficients Frappier, Rahman and Ruscewegh2 proved the following much stronger result: Theorem C. let P ( z)   nv=0 av z v and suppose that then

for |z|=1,

.

Since there is a close connection between the location of zeros of P(z) and its coefficients, the aim of this paper to establish some sharp inequalities concerning the coefficients of polynomialwhen there is a restriction on the estimate of max|z|=r|P(z) and zeros of P(z). In this connection, if P ( z)  nj=0 a j z j for

, then the inequality (1 .7)

Is trivial. We first prove the the following non trivial result, which in particular provides an improvement of the inequality (1.7) and yields a number of results as special cases: Theorem 1. Let P ( z)  nj=0 a j z j

(1 .4) Concerning the size of , the following inequality is well known

be a polynomial of degree n which does not vanish in 1, then

R n max|z|=r | P( z )|  r n max| P( z )|, |z|=R

(1.5)

With equality for

.

If we restrict ourselves to the class of polynomials having no zero in Jain5 replaced (1.5) by

( R + k ) n max|z|=r | P ( z )|  ( r + k ) n max| P ( z )|, |z|=R

0rRk

(1.8) and

(1.6)

(1.9) The result is best possible with equality for . Instead of proving Theorem 1, we prove the following more general result. Theorem 2. Let P ( z)  nj=0 a j z j be a polynomial of degree n which

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)


M.S. Pukhta, J.Comp.&Math.Sci. Vol.1(4), 437-442 (2010) does not vanish in

, then

for

439

polynomial is

.

The next Corollary is also an immediate consequence of Theorem 2. (1.10)

and

Corollary 2. Let be a polynomial of degree n. If for some integer ,

(1.11) where

,

(1.12)

Then

(1.15) has at least one zero in

The result is best possible and equality holds for the polynomial

From inequality (1.11) and inequality (1.14), we deduce the following:

. Applying Theorem 2 to the polynomial , we immediately get the following:

Corollary 3. Let be a polynomial of degree n. If for some integer then the circle separates the zeros of .

Corollary 1. If P ( z)  ďƒĽnj=0 a j z j is a polynomial of degree n having all its zeros in , then

We next present the following sharp result when there is a restriction on the zeros of . Theorem 3. Let

(1.13) and (1.14) Where is defined by (1.12). The result is sharp and extremal

be a poly-

nomial of degree n such that . If the geometric mean of for the zeros of is at least , then (1.16) and

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)


440

M.S. Pukhta, J.Comp.&Math.Sci. Vol.1(4), 437-442 (2010) thesis all the zeros of polynomial

(1.17) Finally, concerning the estimates, max|z|=r|P(z)|, we prove the following result:

lie in where . Therefore, all the zeros of polynomial lie in

Theorem 4. Let P(z) be a polynomial of degree n with real coefficients having all zeros with non positive real

. If

part. If for some then all the zeros of (1.18) Where m is a non negative integer, then P(z) has at least (m+1) zeros in |z|<k. The result is best possible and equality holds for the polynomial

lie in

and . If

in

,

has

, zeros

and the remaining

zeros

on , then has , zeros in |z|>1 and remaining zeros on . Thus the function

.

is analytic for |z|1 and

2. LEMMA For the proof of the theorems, we need the following lemma which is due to Corput and Visser1. Lemma 1. If P ( z)  nj=0 a j z j is a

for . Therefore, by maximum modulus principle, it follows that for

.

equivalently, for

polynomial of degree n such that for

for

.

, then

Replacing z by 2

nj=0|a j |  1

for

(2 .1)

2. PROOFS OF THEOREMS Proof of Theorem 2. By hypo-

, we conclude that .

This implies for

,

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)

(3.1)


M.S. Pukhta, J.Comp.&Math.Sci. Vol.1(4), 437-442 (2010) Unless

is a constant

of absolute value unity. If is constant then it is obvious that for every complex number  with

,

the zeros of

.

lie in

In case is not constant, we e have from (3.1) with the help of Rouche’s theorem that for every real or complex number  with ||>1, all the zeros of lie in . Hence by Gauss-Lucass theorem all the zeros of lie in . That is , all the zeros of

441

the left hand side of (3.2) such that , which is possible, because Making , we get from (3.2)

.

. From which inequality (1.10) follows and this completes the proof of Theorem 2. Proof of Theorem 3. If are the zeros of , then by using the hypothesis, we have

This gives (3.3) Combining (1.1) and (3.3), we get (1.16). Again from inequality (2.1), we have Or

This implies lie in

for all

. This imples

(3.4) (3.2) Choosing the argument of  such that and making

Using (3.3) in (3.4), we get

→1 , we get from (3.2)

From which the result follows and this proves Theorem 3. Which proves inequality (1.11). Again choosing the argument of  in

that

Proof of Theorem 4. Suppose has t zeros in , where

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)


442

M.S. Pukhta, J.Comp.&Math.Sci. Vol.1(4), 437-442 (2010) Which is clearly a contradiction. This establish the Theorem 4 completely.

. Let and assume that

REFERENCES

Put and . The polynomial

,

and have positive e coefficients. Hence for with , we have e (3 .5) by (1.5), and (3 .6) by (1.6). On combining (3.5) and (3.6), we get

1. J.G. Van der Corput and C. Visser, Inequalities concerning polynomials and trigonometric polynomials, Nederal. Akad. Wetensch. Proc. 49, 383-392 (Indag.math. 8, 238-247) (1946). 2. C. Frappier, Q. I. Rahman and S. T. Ruscheweyh, New inequalities for polynomials, Trans. Amer. Math. Soc., 69-99 (1985). 3. V.J. Jain, Converse of an extremal problem in polynomials, J. of Indian math. Soc., 609, 41-47 (1994). 4. Q.I. Rahman, Inequalities concerning polynomials and trigonometric polynomials, Math. Anal. Appl. 6, 303-324 (1963). 5. C. Visser, A simple proof of certain inequalities concerning polynomials, Nederal. Akad. Wetensch. Proc. 47, 276-281 (Indag. math. 7, 81-86.) (1945).

Journal of Computer and Mathematical Sciences Vol. 1 Issue 4, 30 June, 2010 Pages (403-527)


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.