1. Introduction
We recently introduced, in the paper in [
1], the notion of a
Euclidean polynomial. We now refine this concept as follows.
Definition 1. The polynomialwith complex roots is called weak Euclidean if the following equality holds:For such a polynomial P, we call the positive number its Euclidean norm. In addition, if P is hyperbolic, that is, all its roots are real (see [
2]
), then P will be called Euclidean. Regarding this concept, we note the following:
Remark 1. (1) When P, as defined above, runs through the set of Euclidean polynomials of degree n, the map gives an Euclidean correspondence between the relevant subsets of .
(2) For any fixed pair , there is at least one Euclidean polynomial with the given norm . One such example is (3) In [
1]
, the following geometric characterization involving the standard unit -sphere in for weak Euclidean polynomials is given. The polynomial is weak Euclidean if and only if We point out that this characterization implies that and it is independent of the coefficient , the negative of the sum of roots of P. In particular, for , one observes that .
(4) More generally, for the polynomial P in (
1)
, we define its Euclidean defect as Hence, P is weakly Euclidean if and only if . From the inequality between the arithmetic and geometric means, we have that This gives the following necessary condition: If , then P is weakly Euclidean.
(5) It is well known that the characteristic polynomial of a symmetric matrix Γ with real entries is real-rooted. So, we can call Γ a (weak) Euclidean if its characteristic polynomial is so.
(6) The hyperbolic polynomials and their multivariate generalization (called Garding hyperbolic; see, for example, [
3]
) appear in a natural way in various mathematical settings from real algebraic geometry and discrete mathematics to PDEs and (polynomial) optimization. So, there is an increasing scientific interest in producing and studying some classes of hyperbolic polynomials. In an effort to investigate these classes of polynomials, one can start studying methods to obtain remarkable elements in the set
of hyperbolic polynomials; recall after [
4] that this set is a basic semialgebraic set. The aim of the present note is to find hyperbolic polynomials of low degrees by using two maps, the Wronksian and a dual one, which we call Leibniz. Recall that given two
-maps
, their Wronskian is the map
, given by
So, the dual map will be
, given by
. We point out that the idea to use the Wronskian map was inspired by the excellent book [
5], where the Schapira Theorem concerning the Wronskian of a set of polynomials is discussed; see also page 338 of [
6].
Hence, since all polynomials of one degree are already Euclidean, we search for hyperbolic and weak Euclidean polynomials of two and three degrees generated by these maps applied to polynomials of these degrees. We point out that our work is oriented mainly toward examples, and hence, sometimes the class of palindromic or reciprocal polynomials is involved in our computations.
The contents of this paper are as follows.
Section 2 studies the pairs
. Some of the examples from this section are connected with the splitting problem, with an example from the Schapira Theorem and with the cubic palindrome.
Section 3 has two subsections according to the cases
, respectively, both
and
. Since this section deals with cubic polynomials, special attention is oriented to the depressed expressions. The fourth section concerns the palindromic cubic case obtaining the polynomial
as a fixed point for both partial Wronskian and Leibniz maps. We also note that in sections two and three, some partial Wronskian and Leibniz maps are described as affine maps, and moreover, for the cubic cases, an associated elliptic curve is given with its lattice points. In the next section, we introduce a particular sequence
of polynomials, which we call Rodrigues, since all polynomials are generated by a given quadratic polynomial
G through a Rodrigues-type formula; the class of Legendre polynomials is our basic example. The computations of the previous sections are applied for
and
. The last section concerns the conclusions and presents an open problem: the interesting question raised by one of the referees of whether some of the studied polynomials can be characterized through differential equations.
2. The Second Degree
The second degree is provided in our approach by the polynomials and , and we directly obtain
Proposition 1. The negative Wronskian of and iswhich is a hyperbolic polynomial if and only if . The equality case of this condition means that the dual polynomial of , namely , is a hyperbolic one and c is one of its roots. If , then the polynomial is Euclidean. Example 1. (1) If , then the polynomial is hyperbolic if and only if . In particular, if and , then the non-hyperbolic is transformed through the map into the hyperbolic polynomial .
The weak Euclidean polynomials of two degrees are given by , and hence, the weak Euclidean is transformed by into the non-hyperbolic . In conclusion, the map does not preserve the set , nor the complementary set .
(2) If , then the hyperbolicity reduces to , and then the trivial hyperbolic (and Euclidean) is transformed by the map into the hyperbolic (and Euclidean) polynomial .
(3) If the initial polynomial is a hyperbolic one with the roots , then the hyperblicity condition for reads .
An important source of strictly hyperbolic polynomials (i.e., having all real and distinct roots) is the splitting problem for a pair (a given prime number p, a monic polynomial ), which we present after [
7]
. Reducing the coefficients of f modulo p gives a new polynomial , which may be reducible. Then, f admits a p-splitting if is the product of distinct linear factors. For example, let and . Then, admits a p-splitting if and only if there exists such that the polynomial is strictly hyperbolic with the discriminant for . Example 1.1.1.
of the paper in [
7]
concerns , and the list of available p begins with Indeed, for , we have the data , while for , we have the data . Concerning the second map, we have
Proposition 2. The Leibniz map of and satisfieswhich is a hyperbolic polynomial if and only if and weak Euclidean if and only if . Hence, if , then is an Euclidean polynomial. Example 2. If the initial is a hyperbolic one with , then the polynomial is also hyperbolic, since then . In the Euclidean particular case of , we obtain an Euclidean if and only if .
Example 3. As we already mentioned in the Introduction, the Schapiro Theorem is discussed and illustrated by an example on page 338 of the book in [
6]
. The example is as follows: The initial complex polynomials , have the Wronskian with the real roots . Hence, the linear subspace of is also generated by the polynomials , having all real coefficients. If we transfer and into our (which is non-hyperbolic) and , it results the coefficients , , and then It is amazing that the dual ∗ of the first polynomial is exactly , having as positive root the Golden ratio ϕ; see ([
1]
, p. 65). An interesting class of hyperbolic polynomials consists in polynomials with their roots lying in an interval of length ; see [
8]
. The above roots , although for a complex polynomial, satisfy this condition, since . Example 4. The palindromic cubic polynomial , has the real root , and then it has the decomposition and, dividing by u, it follows our polynomial with , . The initial cubic polynomial P is hyperbolic if and only if , which means that . The limit case corresponds to the hyperbolic cubic .
Example 5. Fix the polynomial and its derivative . The Wronskian of P is, by definition, the Wronskian , and we obtainwhich is hyperbolic if and only if , and hence, a necessary condition for hyperbolicity of is . Also, we have that P and are simultaneously hyperbolic if and only if P is the square . The polynomial is weak Euclidean if and only if . Remark 2. The transformations , can be viewed as affine maps as follows:respectively, 3. The Third Degree
The case of the third degree can be obtained in two ways: firstly from the pair
and secondly from the pair
. We recall the discussion of
the depressed cubic equation:
Namely, if
the determinant , the cubic equation has three distinct real solutions, while if
, then the equation has three real solutions, out of which two are equal; for details, see [
9].
3.1. The First Pair
We begin with the Wronskian map.
Proposition 3. For the Wronskian of the first pair, we have The translation gives the depressed cubic polynomial As an affine map, the transformation isand we point out that the matrix belongs to the Lie algebra . Example 6. If , then the coefficients and the determinant of the depressed cubic areand the above map reduces to a linear one. There are two cases of a vanishing determinant. Case 1: . We have the hyperbolic polynomial: For , we can associate the following singular cubic curve:which has 12
lattice points (0,
±1),
, , , , . Case 2: and . We have the following polynomials: The Y-solutions of the second polynomial are . With , we associate the following singular cubic curve:with 11
lattice points: , , , , , . Example 7. If , i.e., the initial is depressed, then the coefficients and the determinant of the resulted cubic are The case of a vanishing D corresponds to the following hyperbolic cubic:and Y-solutions of the last depressed cubic are . We now turn to the Leibniz map.
Proposition 4. For the Leibniz map of the first pair, we have The translation gives the depressed cubic polynomial with As an affine map, the transformation is Example 8. reduces the above map to a linear one and gives , . In particular, if , then .
3.2. The Second Pair
The Wronskian map of the second pair yields a polynomial of two degrees, and hence, we postpone this method to the end of this subsection.
Proposition 5. For the Leibniz map of the second pair, we have The translation gives the depressed cubic polynomial with Example 9. Suppose that both and are Euclidean with . Then, Hence, there are two cases of a vanishing q and therefore a hyperbolic :
Case 1: If , i.e., , we obtain .
Case 2: If , then .
We return now to the Wronskian:
Proposition 6. The Wronskian map of the second pair iswhich is a hyperbolic polynomial if and only if This condition holds for when is one degree.
Example 10. Suppose that and , are Euclidean with and . The resulting Wronskian iswhich is hyperbolic if and only if . For example, if is exactly the dual , then , and we obtain the following palindromic:which is hyperbolic if and only if ; irrespective of the value of a, the roots of the polynomial (
30)
are located in an interval of length . Example 11. Suppose that both and are hyperbolic with the roots and , respectively. Then, we have all the previous computations with 4. The Palindromic Cubic Revisited
We now apply the computations of the previous section to the palindromic
. Proposition 3 gives
which is also palindromic if and only if
and
. Hence, the following:
Proposition 7. The palindromic hyperbolic polynomial is a fixed point of the map .
Proposition 4 gives
and the following:
Proposition 8. The palindromic hyperbolic polynomial is a fixed point of the map .
The singular cubic curve again has 11 lattice points: , , , , , . With the translation , we have the semicubical parabola .
Example 12. In the paper in [
1]
, the case is an example of a Euclidean cubic polynomial. From (
32)
and (
33)
, we have the following polynomials:but both these polynomials are nonpalindromic. With the characterization in (
4)
, we have that is weak Euclidean only for , while is weak Euclidean only for . 6. Conclusions and Future Works
Testing whether a given real monic polynomial is of hyperbolic type is a complicated job in general; see, for example, [
11]. The main idea of the present study is that classes of hyperbolic and weak Euclidean polynomials of two and three degrees are generated in a unitary way through the Wronskian map and the Leibniz map. Special attention is given to polynomials having additional properties, such as the palindromic property.
The present work is only the first step in a series of papers that propose methods to obtain hyperbolic and weak Euclidean polynomials. One first future direction of study is to increase the degrees of the involved polynomials. A second variant is to fix
and to generate hyperbolic and weak Euclidean polynomials by using the Leibniz map
from the Introduction. A third subject of interest is to search if the Nuij theorem ([
4]) still works in the setting of weak Euclidean polynomials or possible variants of this famous result. Finally, since this paper only addresses the mathematical aspects of the proposed methods, an interesting point of view is to study the computational/algorithmic complexity of these methods.