1. Introduction
The classical Eneström-Kakeya Theorem concerns the location of the complex zeros of a real polynomial with nonnegative monotone coefficients. It was independently proved by Gustav Eneström in 1893 [
4] and Sōichi Kakeya in 1912 [
10].
Theorem 1.
Eneström-Kakeya Theorem.
If is a polynomial of degree n (where z is a complex variable) with real coefficients satisfying , then all the zeros of P lie in .
A large body of literature on results related to the Eneström-Kakeya Theorem now exists. For a survey of results up through 2014, see [
7]. Inspired by results of Aziz and Zargar [
1] and Shah et al. [
15], the present authors gave an Eneström-Kakeya type result [
5] for polynomials
such that
and
for
where, for some positive numbers
and
each at most 1, and
,
each at least 1, and
p and
q with
, the coefficients satisfy
and
The present authors recently generalized this result [
6] by adding parameter
j with
(which allows a reversal in the monotonicity condition) and using a total of six positive parameters
,
,
, and
each at most 1, and
,
each at least 1, to consider polynomials with complex coefficients satisfying
and
Notice that with
,
,
,
and each
, the above condition implies the hypotheses of the Eneström-Kakeya Theorem.
The first result concerning the number of zeros in a disk relevant to the current work, is due to Mohammad in 1965. It considers polynomials with real coefficients which satisfy the monotonicity condition of the Eneström-Kakeya Theorem (with the added condition that the constant term is nonzero) and is as follows [
11].
Theorem 2. Let be a polynomial of degree n with real coefficients such that . Then the number of zeros of in the disk does not exceed .
Another relevant result is due to Dewan [
3] and concerns a monotonicity condition on the moduli of coefficients, as follows.
Theorem 3.
Let be a polynomial of degree n with complex coefficients such that for some real β, for and . Then the number of zeros of in does not exceed
Though both Theorems 2 and 3 concern zeros in
, more general results exist. For example, Pukhta [
12] gave the following generalization of Theorem 3 which reduces to Theorem 3 when
.
Theorem 4.
Let be a polynomial of degree n with complex coefficients such that for some real β, for and . Then, for , the number of zeros of in does not exceed
Recently, the number of zeros in a disk of a polynomial with coefficients satisfying a monotonicity condition, but with extra multiplicative terms on some of the coefficients, have been presented. Rather et al. [
14], for example, considered polynomials with real coefficients satisfying
where
for
and
. Rather et al. [
13] (in a publication different from the previously cited one) similarly considered a monotonicity condition, but with extra additive terms on some of the coefficients. For example, they considered polynomials with real coefficients satisfying
where
for
and
. These results of Rather et al. generalize and refine the earlier results.
The purpose of this paper is to consider complex polynomials satisfying conditions (
1) and (
2) (and a related condition on the moduli of the coefficients) and to give results concerning the number of zeros in a disk.
2. Results
For a polynomial of degree
n with complex coefficients
,
, where
and
, we impose the conditions of equations (
1) and (
2) to get the following.
Theorem 5.
Let be a complex polynomial of degree n with complex coefficients where and which satisfies, for some real and where , , , , , and , the condition
Then the number of zeros of in the disk is less than for , where
, and .
Now we consider a condition similar to that given in equations (
1) and (
2), but imposed on the moduli of the complex coefficients instead of on the real and imaginary parts.
Theorem 6.
Let be a polynomial of degree n with complex coefficients satisfying , , such that for real , where , , , we have
Then the number of zeros of in the disk is less than for , where
, and .
The class of lacunary polynomials of the form
was introduced by Chan and Malik in 1983 [
2] in connection with Bernstein’s Inequality [
2]. For a survey of such results, see subsections 4.1.4, 6.4.2, and 6.4.3 of [
8]. Theorems 5 and 6 naturally apply to such polynomials which satisfy the monotonicity condition on the remaining coefficients. For example, with coefficients
in polynomial
P, we get the following corollary.
Corollary 1.
Let be a complex polynomial of degree n with complex coefficients where and which satisfies, for some real and where , , , , , and , the condition
Then the number of zeros of in the disk is less than where M is as given in Theorem 5, , and .
A similar corollary follows from Theorem 6. In addition, Theorems 5 and 6 naturally apply to lacunary polynomials with two gaps in their coefficients. For example, with coefficients and in polynomial P, we get the following corollary.
Corollary 2.
Let be a complex polynomial of degree n with complex coefficients where and which satisfies, for some real and where , , , , , and , the condition
Then the number of zeros of in the disk is less than where M is as given in Theorem 5 and .
A similar corollary follows from Theorem 6.
The introduction of the reversal of the inequality at index j allows us to shift the point at which the reversal occurs. This flexibility allows us to apply Theorems 5 and 6 to a larger collection of polynomials than some of the other current results in the literature on this topic.
3. Lemmas
The number of zeros results we consider are all based on the following theorem, which appears in Titchmarsh’s
The Theory of Functions [
16, page 280].
Lemma 1. Let be analytic in . Let in the disk and suppose . Then for , the number of zeros of F in the disk does not exceed .
The following lemma is due to Govil and Rahman [
9].
Lemma 2.
Let with . Suppose that for and for some real α and β. Then
4. Proofs of the Results
Proof of Theorem 5. Consider
For
we have
where
and
. So for
, we have
Since
is analytic in
, by Lemma 1 and the Maximum Modulus Theorem, the number of zeros of
(and hence of
) in
is less than or equal to
where
, as claimed. □
Proof of Theorem 6. Consider
. For
we have,
Hence
Since
is analytic in
, by Lemma 1 and the Maximum Modulus Theorem, the number of zeros of
(and hence of
) in
is less than or equal to
where
, as claimed. □
5. Discussion
As explained in the Introduction, the hypotheses applied in this paper build on similar hypotheses in the setting of results on the the location of zeros of a complex polynomial; namely, the Eneström–Kakeya Theorem and its generalizations. Future research could involve loosening or revising the monotonicity conditions of Theorems 5 and 6. For example, the mototonicity conditions of Rather et al. in [
13,
14], mentioned in the Introduction, could be imposed on the real and complex parts of the coefficients and on the moduli of the coefficients to produce related results. Theorems 5 and 6 concern a single reversal in the monotonicity condition, so this could be generalized to multiple reversals. In addition, combinations of the montonicity conditions presented here could be combined with others in the literature (such as those in [
13,
14]).
Author Contributions
Conceptualization, R.G. and M.G.; formal analysis, R.G. and M.G.; writing—original draft preparation, R.G. and M.G.; writing—review and editing, R.G. and M.G. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable
Informed Consent Statement
Not applicable
Data Availability Statement
Not applicable
Conflicts of Interest
The authors declare no conflict of interest.
References
- A. Aziz and B. A. Zargar, Bounds for the zeros of a polynomial with restricted coefficients, Appl. Math. 2012, 3, 30–33. [CrossRef]
- T. N. Chan and M. A. Malik, On Erdos-Lax theorem, Proc. Indian Acad. Sci. 1983, 92, 191–193.
- K. K. Dewan, Extremal properties and coefficient estimates for polynomials with restricted zeros and on the location of zeros of polynomials, Ph.D. Thesis, Indian Institute of Technology, Delhi, 1980.
- G. Eneström, Härledning af en allmän formel för antalet pensionärer, som vid en godtyeklig tidpunkt förefinnas inom en sluten pensionslcassa, Övfers. Vetensk.-Akad. Fórhh. 1893, 50, 405–415.
- R. Gardner and M. Gladin, Generalizations of the Eneström-Kakeya Theorem Involving Weakened Hypotheses, AppliedMath 2022, 2(4), 687–699. [CrossRef]
- R. Gardner and M. Gladin, The Number of Zeros in a Disk of a Complex Polynomial with Coefficients Satisfying Various Monotonicity Conditions, submitted.
- R. Gardner and N. K. Govil, The Eneström-Kakeya Theorem and Some of Its Generalizations, in Current Topics in Pure and Computational Complex Analysis, ed. S. Joshi, M. Dorff, and I. Lahiri, New Delhi: Springer-Verlag, 2014; 171–200.
- R. Gardner, N. K. Govil, and G. V. Milovanovi’c, Extremal Problems and Inequalities of Markov-Bernstein Type for Algebraic Polynomials, Elsevier, Inc., 2022. [CrossRef]
- N. K. Govil and Q. I. Rahman, On the Eneström-Kakeya theorem, Tôhoku Math. J. (2) 1968, 20, 126–136.
- S. Kakeya, On the limits of the roots of an algebraic equation with positive coefficients, Tôhoku Math. J. First Ser. 1912–1913, 2, 140–142.
- Q. G. Momhammad, On the zeros of the polynomials, Amer. Math. Monthly 1965 72, 631–633.
- M. S. Pukhta, On the zeros of a polynomial, Appl. Math. 2011, 2, 1356–1358.
- N. A. Rather, L. Ali, A. Bhat, On the number of zeros of a polynomial in a disk, Annali Del’Universita’ Di Ferrara, published online 05 May 2023. [CrossRef]
- N. A. Rather, A. Bhat, and L. Ali, Number of zeros of a certain class of polynomials in a specific region, J. Class. Anal. 2021, 18(1), 29–37. arXiv:10.7153/jca-2021-18-03.
- M. A. Shah, R. Swroop, H. M. Sofi, I. Nisar, A generalization of Eneström-Kakeya Theorem and a zero free region of a polynomial, J. Appl. Math. Phys. 2021, 9, 1271–1277. arXiv:10.4236/jamp.2021.96087.
- E. C. Titchmarsh, The Theory of Functions, second edition, Oxford University Press, London, 1939.
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).