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 [
1] and Sōichi Kakeya in 1912 [
2].
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 [
3]. Inspired by the results of Aziz and Zargar [
4] and Shah et al. [
5], the present authors gave an Eneström–Kakeya-type result [
6] 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
For such polynomials, all the zeros of
P lie in the closed annulus:
where
and
. The present authors recently generalized this result [
7] by adding the parameter
j such that
(which allows a reversal in the monotonicity condition) and using a total of six positive parameters,
,
,
, and
, each at most 1, and
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 was published by Mohammad in 1965. It considers polynomials with real coefficients tha satisfy the monotonicity condition of the Eneström–Kakeya theorem (with the added condition that the constant term is nonzero) and is as follows [
8]:
Theorem 2. Let be a polynomial of degree n with real coefficients such that . The number of zeros of in the disk does not exceed .
Another relevant result is due to Dewan [
9] 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 . 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 [
10] 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 . 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, has been presented. Rather et al. [
11], for example, considered polynomials with real coefficients satisfying
for some
,
where
. Rather et al. [
12] (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
for some
,
where
. 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 obtain 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 conditionswhere . The number of zeros of in the disk is then less than for , where , and . We now 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 havewhere . The number of zeros of in the disk is then less than for , where , and .
The class of lacunary polynomials of the form
was introduced by Chan and Malik in 1983 [
13] in connection with Bernstein’s Inequality [
13]. For a survey of such results, see Subsections 4.1.4, 6.4.2, and 6.4.3 of [
14]. Theorems 5 and 6 naturally apply to such polynomials that satisfy the monotonicity condition on the remaining coefficients. For example, with coefficients
in polynomial
P, we obtain 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 conditionswhere . The number of zeros of in the disk is then 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 the coefficients and in polynomial P, we obtain 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 conditionswhere . The number of zeros of in the disk is then 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.
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.
Applications related to the zeros of polynomials run from the graphing of polynomials using the zeros of the first and second derivatives to the computation of eigenvalues from the characteristic polynomial of a (real or complex) matrix. For example, equilibria of systems of differential equations and the stability classification of equilibria are based on complex eigenvalues. A number of real-world models involve transition matrices, which must be diagonalized, and this process involves the zeros of the characteristic polynomial. In graph theory, a graph has adjacency and chromatic polynomials, the zeros of which give information about the graph itself. The results of the paper have potential applications in each of these settings.
Future research could involve loosening or revising the monotonicity conditions of Theorems 5 and 6. For example, the monotonicity conditions of Rather et al. in [
11,
12], 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 monotonicity conditions presented here could be combined with others in the literature (such as those in [
11,
12]).