THE SECOND ZOLOTAREV CASE IN THE ERD ¨OS-SZEG ¨O SOLUTION TO A MARKOV-TYPE EXTREMAL PROBLEM OF SCHUR

. Schur’s [21] Markov-type extremal problem is to determine (i) M n = sup − 1 ≤ ξ ≤ 1 sup P n ∈ B n,ξ, 2 ( | P (1) n ( ξ ) | /n 2 ), where B n,ξ, 2 = { P n ∈ B n : P (2) n ( ξ ) = 0 } ⊂ B n = { P n : | P n ( x ) | ≤ 1 for | x | ≤ 1 } and P n is an algebraic polynomial of degree ≤ n . Erd¨os and Szeg¨o [4] found that for n ≥ 4 this maximum is attained if ξ = ± 1 and P n ∈ B n, ± 1 , 2 is a (unspeciﬁed) member of the one-parameter family of hard-core Zolotarev polynomials. An extremal such polynomial as well as the constant M n we have explicitly speciﬁed for n = 4 in [18], and in this paper we strive to obtain an analogous amendment to the Erd¨os - Szeg¨o solution for n = 5. The cases n > 5 still remain arcane. Our approach is based on the quite recently discovered explicit algebraic power form representation [6], [7] of the quintic hard-core Zolotarev polynomial, Z 5 ,t , to which we add here explicit descriptions of its critical points, the explicit form of Pell’s (aka: Abel’s) equation, as well as an alternative proof for the range of the parameter, t . The optimal t = t ∗ which yields M 5 = | Z (1)5 ,t ∗ (1) | / 25 we identify as the negative zero with smallest modulus of a minimal P 10 . We then turn to an extension of ( i ), to higher derivatives as proposed by Shadrin [23], and we provide an analogous solution for n = 5. Finally, we describe, again for n = 5, two new algebraic approaches towards a solution to Zolotarev’s so-called ﬁrst problem [2], [25] which was originally solved by means of elliptic functions.


THE SECOND ZOLOTAREV CASE IN THE ERDÖS-SZEGÖ SOLUTION TO A MARKOV-TYPE EXTREMAL PROBLEM OF SCHUR
HEINZ-JOACHIM RACK † Abstract. Schur's [21] Markov-type extremal problem is to determine (i) Mn = sup −1≤ξ≤1 sup Pn∈B n,ξ,2 (|P (1) n (ξ)|/n 2 ), where B n,ξ,2 = {Pn ∈ Bn : P (2) n (ξ) = 0} ⊂ Bn = {Pn : |Pn(x)| ≤ 1 for |x| ≤ 1} and Pn is an algebraic polynomial of degree ≤ n. Erdös and Szegö [4] found that for n ≥ 4 this maximum is attained if ξ = ±1 and Pn ∈ Bn,±1,2 is a (unspecified) member of the one-parameter family of hard-core Zolotarev polynomials. An extremal such polynomial as well as the constant Mn we have explicitly specified for n = 4 in [18], and in this paper we strive to obtain an analogous amendment to the Erdös -Szegö solution for n = 5. The cases n > 5 still remain arcane. Our approach is based on the quite recently discovered explicit algebraic power form representation [6], [7] of the quintic hard-core Zolotarev polynomial, Z5,t, to which we add here explicit descriptions of its critical points, the explicit form of Pell's (aka: Abel's) equation, as well as an alternative proof for the range of the parameter, t. The optimal t = t * which yields M5 = |Z (1) 5,t * (1)|/25 we identify as the negative zero with smallest modulus of a minimal P10. We then turn to an extension of (i), to higher derivatives as proposed by Shadrin [23], and we provide an analogous solution for n = 5. Finally, we describe, again for n = 5, two new algebraic approaches towards a solution to Zolotarev's so-called first problem [2], [25] which was originally solved by means of elliptic functions.
In 1919 I. Schur [21, § 2], inspired by Markov's problem, was led to the problem of finding the maximum of |P (1) n (ξ)|/n 2 under the additional restriction P (2) n (ξ) = 0 where ξ ∈ I is a given number. In 1942 P. Erdös and G. Szegö addressed Schur's problem and they showed in [4,Th. 2] that under the said restriction the value |P (1) n (ξ)|/n 2 , n ≥ 4, will attain the maximum, M n , only if ξ = ±1 and P n ∈ B n coincides with an n-th degree proper Zolotarev polynomial relative to I. Such a polynomial is, for each n, a member of some one-parameter family of polynomials and an extremal one among that family was therefore coined Schur polynomial by F. Peherstorfer and K. Schiefermayr [16, Section 5d], see Section 3 for details.
Although both solutions to the stated problems have in common that the maximum is attained at the endpoints ±1 of I, they differ greatly when it comes to exhibit an explicit extremal polynomial from B n : The algebraic power form representation of an extremizer ±T n in Markov' problem is explicitly known [19]. On the contrary, a (parameterized) algebraic power form representation of a proper Zolotarev polynomial is not known for a general n, nor is the optimal parameter known which singles out the Schur polynomial. Rather, proper Zolotarev polynomials are usually expressed by means of elliptic functions (see N. I. Achieser [1, p. 280], B. C. Carlson and J. Todd [2], [15, p. 407], E. I. Zolotarev [25]), a presentation form which is considered as very complicated [2].
The purpose of this note is threefold: To describe, for n = 5, in more detail the Erdös-Szegö solution [4] to Schur's problem, the A. Shadrin solution [23] to the generalized Schur's problem, and to provide new algebraic solutions to Zolotarev's so-called first problem [2], [25]. To this end, we take advantage of a quite recently published explicit (parameterized) power form representation of the proper quintic Zolotarev polynomial [6], [7].
In Section 2 we introduce the (parameterized) proper Zolotarev polynomial and in particular the said novel power form representation for the degree n = 5 due to G. Grasegger and N. Th. Vo. As a supplement to their result we provide explicit formulas for its critical points (to be defined below), the explicit form of Pell's (aka: Abel's) equation and an alternative proof for the range of its parameter.
In Section 3 we turn to the Erdös-Szegö solution [4] of Schur's problem for n = 5. The optimal parameter of the Schur polynomial we describe as a zero of a dedicated P 10 . From this we deduce numerical approximations for the coefficients of the Schur polynomial as well as for the sought-for constant M 5 .
In Section 4 we consider a generalization of Schur's problem due to Shadrin [23]. It is based on V. A. Markov's inequality of 1892 [13] for the higher derivatives of P n . Again we will exemplify the degree n = 5, now making use of Proposition 4.4 in [23].
In Section 5 we describe, taking recourse to results from Section 2, two new algebraic approaches to Zolotarev's first problem of 1877 [2], [25] (for n = 5) which asks to determine a P n , with prescribed values for its first and second leading coefficient, that deviates least (in the uniform norm) from the zero function in I.
The explicit quartic Schur polynomial (first Zolotarev case, see [18]) and the here introduced approximate quintic Schur polynomial (second Zolotarev case), may well serve as illustrating instances of the result in [4,Th. 2], which is referred to in S. R. Finch's book [5,Section 3.9].
According to [4, p. 453], [23, p. 1190], a proper Zolotarev polynomial belongs to B n , is of exact degree n, and equioscillates n times in I. The equioscillation points −1 ≤ z 0 < z 1 < z 2 < ... < z n−2 < z n−1 ≤ 1, at which the values ±1 are attained alternately, include both endpoints of I, that is, −1 = z 0 and z n−1 = 1. To be compliant with [4], we assume that at the endpoint −1 = z 0 the value (−1) n−1 is attained. Thus a proper Zolotarev polynomial has n − 1 roots in the interior of I, and it is furthermore required that it has one additional root outside of I, and we assume, again following [4], that this root is to the right of I. According to the quoted references above, it is more specifically required that there exist three points A n , B n and C n with 1 < A n < B n < C n , which we call Zolotarev points, having the property that the proper Zolotarev polynomial of degree n attains the value 1 at x = B n and the value −1 at x = C n (so that its n-th root is sandwiched between B n and C n ) and that its first derivative vanishes at x = A n .
But all these stated requirements do not uniquely determine a polynomial of degree n; rather, there are infinitely many polynomials which fulfill these conditions. Therefore we will denote a proper Zolotarev polynomial of degree n by Z n,t . The additional parameter t indicates that the coefficients of Z n,t are not constant but vary with t, which in turn varies in some interval of R (which may be different for different n's). The equioscillation points of Z n,t in the interior of I also depend on t, so that we will denote them more precisely by z 1 (t) < z 2 (t) < ... < z n−2 (t), and the Zolotarev points A n < B n < C n we will likewise denote more precisely by A n (t) < B n (t) < C n (t). These n + 1 parameterized points on the x-axis which characterize Z n,t (together with the identities Z n,t (−1) = (−1) n−1 and Z n,t (1) = 1) will be called the critical points of Z n,t . Besides Z n,t , the polynomials −Z n,t as well as ±Q n,t , where Q n,t (x) = Z n,t (−x), are also considered as proper Zolotarev polynomials.
When trying to represent Z n,t in the usual (parameterized) algebraic power form as a linear combination of monomials, one encounters severe difficulties. According to [11, p. 932], A. A. Markov himself tried to find an algebraic solution, but he was not fully successful, because an algebraic solution requires an amazing amount of calculations. To the best of our knowledge, the current situation concerning the algebraic power form representation of hardcore Zolotarev polynomials relative to I can be delineated as follows: n = 2: An algebraic representation is readily found, e.g., , t > 1, see also [2, pp. 2]. But it is unexpectedly complicated to derive it from the elliptic representation, see [2, pp. 11]. n = 3: The task to determine Z 3,t is posed as a problem in [19, p. 94]. A solution has been provided by several authors and is given by [2, pp. 4]. n = 4: Algebraic representations have been provided by the present author [17, p. 357] and by Shadrin [22, p. 242], and can be traced back to a result of V. A. Markov [13, p. 73], which is not contained in the abridged German translation [14] of [13], see [18] for details.
According to [23, p. 1185], there is no explicit expression for (proper) Zolotarev polynomials of degree n > 4. But only quite recently it was claimed by Grasegger and Vo [6] that such an expression has been obtained for 5 ≤ n ≤ 6 by making use of symbolic computation (they also treat n ≤ 4). We focus here on the representation for the degree n = 5 in [6] and may leave aside the degree n = 6, see Remark 9 below. In order to be compliant with the assumptions made about Z n,t , we transform the term y(x) ≡ y 5,t (x) as given in [6, p. 12] to Y 5,t (x) := −y(−x). In this way we get where the parameterized coefficients a i (t) are defined as follows: with (10) κ := κ(t) = 1 (−1+t) 6 (1+3t) 4 and v 1 : It is readily verified that for certain values of the parameter t the monomial representation Y 5,t is not defined (e.g., for t = 1), is complex-valued (e.g., for t = −0.5), or does not belong to B 5 (e.g., for t = 2 (and x = 0)). In order that Y 5,t should represent a quintic hard-core Zolotarev polynomial, it is therefore mandatory to appropriately restrict the range of the parameter t. This need we have communicated to one of the authors of [6], and in [7] Grasegger was able to provide the maximal range for the parameter t appearing in y(x) ≡ y 5,t (x), respectively in Y 5,t . We concede that an explicit algebraic power form representation of the quintic hard-core Zolotarev polynomial constitutes a major breakthrough in the long history of these intricate polynomials.
Proposition 1. (see [6], [7]). The (parameterized) algebraic power form of the quintic hard-core Zolotarev polynomial on I, Z 5,t , coincides with that of Y 5,t as given in (3)-(10), provided the parameter t belongs to the open interval . From now on we will identify Z 5,t with Y 5,t but will assume that the parameter t belongs to J 5 . Below we will provide an alternative proof for the range (11) of t. The algebraic power form representation of y(x) ≡ y 5,t (x) in [6], [7] does not include the determination of the critical points, a goal which we are now going to address for Z 5,t . To begin with, it is readily verified that there holds (12) Z 5,t (−1) = Z 5,t (1) = 1.
We first turn to the determination of the three equioscillation points of Z 5,t in the interior of I. The equation Z (10)) we have solved with a symbolic mathematical computation program (Mathematica™, version 10, symbol Solve). It renders in particular the following three solutions x 1 , x 2 , x 3 , as can be verified by inserting them backwards into the left hand side of (13): where with v 1 according to (10), Plugging these zeros of Z 3 behave like the three ordered equioscillation points z i (t), i = 1, 2, 3, of Z 5,t in the interior of I. And in fact they coincide with the z i (t)'s since there is no other choice left: From the requirements which Z 5,t must fulfill we know that we have Consider first x 1 with property Z 5,t (x 1 ) = −1 and Z (1) 5,t (x 1 ) = 0. Consequently, in view of (21) and (23), , z 3 (t)} and obviously x 1 = x 3 holds as can be seen by evaluating But the latter inequality cannot occur as can be seen by evaluating (22) and (23), Hence we have as claimed (24) x We now turn to the determination of the three Zolotarev points It is tempting to determine B 5 (t) and C 5 (t) as solutions of the polynomial equations Z 5,t (x) ± 1 = 0 with the aid of a symbolic computation program. This approach, however, leads to complex-valued solutions. We therefore proceed as follows: According to [16,Formula (5.11)], the numbers B 5 (t) and C 5 (t) satisfy a set of four equations of which the first two of these read (using the shorthand from which B 5 (t) and C 5 (t) can be recovered by substitution: ).
The value of A 5 (t) we deduce from Formula (5.21) in [16] where A 5 (t) is expressed with the aid of B 5 (t) and C 5 (t): The employed terms v 1 , v 2 , v 3 , v 4 , v 5 above have been defined in (10), (17)- (20). Virtually for any parameter t ∈ J 5 one is now able to determine Z 5,t (by calculating its six coefficients (4)-(9)) as well as its six critical points given in (14)-(16) (identifying there x i = z i (t), i = 1, 2, 3) and in (27)-(29). The knowledge of these points allows one to calculate Z 5,t in alternative fashions, for example, by means of interpolation formulas since the values of Z 5,t at those points (and at z 0 , z 4 ) are known. A particular alternative form to represent Z 5,t (t ∈ J 5 ) can be deduced from [20,Lemma 1]. It is a concrete implementation of the expression as given in [20] since we know the critical points which enter into this expression: The knowledge of the Zolotarev points allows to provide a concrete implementation of the famous Pell's equation (aka: Abel's equation) for hard-core Zolotarev polynomials (see [20, p. 149], [24, p. 2486]), stated here for n = 5:

Summarizing we get
The six critical points of Z 5,t are explicitly determined by (14) An alternative proof, compared to the one given in [7], for the maximal range J 5 in (11) of the parameter t of Z 5,t can now be had as follows: We let A 5 (t) ∈ (1, ∞) tend first towards 1 and then towards infinity and study the limiting behavior of t. Solving A 5 (t) = 1 numerically, we obtain the solutions t = −0.1055728090... and t = 1, of which the latter drops out because Z 5,1 is not defined. The former one, evaluated to high precision, is readily seen (e.g., by applying Mathematica™'s RootApproximant -symbol) to be identical to the irrational number t • . And indeed A 5 (t • ) = 1 holds as is verified by insertion. Thus, t → t • from the right. Employing Mathematica™'s Limit -symbol would have produced the same finding.
To guess for which parameter t the expression C 5 (t) becomes infinite, we numerically solve the equation C 5 (t) − 10 n = 0 for t and various large values of n and get, approximately, t = − 5 4 10 −2n−1 . This indicates that for t → 0 from the left the value C 5 (t) will tend to infinity. And this is indeed the case as can be seen from the power series expansion of C 5 (t) about the point t = 0: Employing Mathematica™'s Limit -symbol would have produced the same finding. This completes our alternative proof for the maximal range J 5 of the parameter t of Z 5,t . We leave it to the reader to verify that when t is approaching the limits of J 5 , then Z 5,t (x) will transform into −T 5 ( x+t • 1−t • ) respectively into T 4 (x), see also [4, p. 456] and Section 4 below.
Subsequently we shall need the values of the first four derivatives of Z 5,t evaluated at the point x = z 4 = 1. We provide them here for the reader's convenience: with κ and v 1 according to (10).

THE QUINTIC SCHUR POLYNOMIAL
A. A. Markov's inequality [12] asserts an estimate on |P This maximum will be attained if, up to the sign, x = 1 and P n = T n ∈ B n . Schur [21, § 2], considered the related extremal problem under the additional condition P (2) n (ξ) = 0, where ξ ∈ I is given: Determine ξ ∈ I and P n ∈ B n for which Let n ≥ 4. The maximum (38) will be attained only if ξ = 1 and P n = ±Z n,t or if ξ = −1 and P n = ±Q n,t (where Q n,t (x) = Z n,t (−x)). For n = 3 the maximum (38) will be attained only if ξ = 0 and P 3 = ±T 3 .
For a general polynomial degree n the coefficients a i (t) of Z n,t and the optimal parameter t = t * for which the corresponding Z n,t * attains the maximum in (38), as well as the value M n itself, remain arcane. However, as for the first Zolotarev case, n = 4, we have shed some new light on the above Erdös-Szegö solution by providing explicit analytical expressions for the value M 4 as well as for the optimal parameter t = t * , and hence for the extremal coefficients a i (t * ), i = 0, 1, 2, 3, 4, of the extremizer polynomial Z 4,t * , see [18].
We now proceed to provide an analogous amendment for the second Zolotarev case in the above Erdös-Szegö solution, but with the reservation that for n = 5 the optimal parameter t = t * of the sought-for Schur polynomial cannot be expressed by radicals. Rather, t * will be derived numerically (to any precision, and in three different fashions). Therefore, also the coefficients a i (t * ) of Z 5,t * as well as the value M 5 cannot be determined in a closed analytic form so that we resort to numerical approximations. In the presentation of our results we will chop numerical results after the tenth valid decimal place.
Let now n = 5. According to [4,Th. 2], it suffices to consider the polynomials Z 5,t ∈ B 5,1,2 . The equation Z (2) 5,t (1) = 0 in the variable t (see (34)) renders, when solved with Mathematica™'s NSolve -symbol, six real (approximate) solutions: Of these only t * := t 4 is applicable since it satisfies t * ∈ J 5 . Hence the largest value of |Z   An alternative way to deduce the optimal parameter t = t * of Z 5,t with regard to (38) is, utilizing our knowledge of the Zolotarev points A 5 (t) < B 5 (t) < C 5 (t), to solve an equation which necessarily must be satisfied by t = t * , see [4, formula (2.17)] and [16, formula (5.20)]: Solving (44) with Mathematica™'s NSolve -symbol produces (after an excessive runtime) the identical root t = t * as given in (41). A third way to compute t = t * is to construct a polynomial, say P m , with smallest possible degree m and smallest integer coefficients which has t * among its real roots, and then to solve the polynomial equation P m (s) = 0, either by radicals (if possible) or numerically. A desired such minimal polynomial P m of degree m = 10 can be obtained by means of Mathematica™'s Solve -symbol (applied to Z (2) 5,t (1) = 0) or RootApproximant -symbol (applied to sufficiently many (> 70) decimal places of t * when computation is done with high precision in (40)). In this way we get P 10 (s) = 50 + 949s + 1269s 2 − 5772s 3 − 13600s 4 − 5802s 5 + (45) +19518s 6 + 49380s 7 + 54230s 8 + 26525s 9 + 4325s 10 .
First we are going to check if the equation P 10 (s) = 0 can be solved by radicals. To this end we employ the open source symbolic mathematical computation program GAP (package Radiroot, function IsSolvablePolynomial) to find out that the answer is in the negative: The Galois group of P 10 is not solvable so that the zeros of P 10 cannot be expressed by radicals. Solving the equation P 10 (s) = 0 numerically (to a desired precision), e.g., with Mathemat-ica™'s NSolve -symbol, yields the six real solutions  (41). It is obvious from this set of solutions that s 4 = t * is that negative zero of P 10 which has smallest modulus. It is not unusual to describe a sought-for constant (here: t * ) as a certain zero of a minimal algebraic polynomial with integer coefficients: Consider, for example, the definition of J. H. Conway's constant as the unique positive zero of some polynomial P 71 , see ( [5], p. 453).

THE QUINTIC SHADRIN POLYNOMIALS
A. A. Markov's inequality (37) for the first derivative of P n ∈ B n was generalized to the k-th derivatives by his half-brother V. A. Markov [13, p. 93] in 1892. It can be restated as follows, see also [15, p. 545 For each k this maximum will be attained (up to the sign) if x = 1 and P n = T n . Shadrin [23] has analogously generalized Schur's problem, i.e., extending (38) to the k-th derivatives, and it can be stated as follows: Determine ξ ∈ I and P n ∈ B n for which Shadrin [23,Prop. 4.4], also provided the following solution: Let n ≥ 4 and 2 ≤ k ≤ n − 2. The maximum (51) will be attained (up to the sign) if ξ = 1 and P n is a (proper or improper) Zolotarev polynomial, Z n , or if ξ = ω k,n = the rightmost zero of T (k+1) n and P n = T n , so that altogether there holds (under the assumptions Z n ∈ B n,1,k+1 and T The extremal polynomials for 2 ≤ k ≤ n−2 we therefore term Shadrin polynomials. The proper Zolotarev polynomial Z n := Z n,t has been introduced in Section 2. Apart from sign and reflection, the improper Zolotarev polynomial relative to I is either the distorted Chebyshev polynomial Z n := T n,σ , with T n,σ (x) := T n ( x−σ 1+σ ), where 0 < σ ≤ tan 2 ( π 2n ), or the familiar Chebyshev polynomial of degree n or n − 1, Z n = T n respectively Z n = T n−1 , see [1], [2], [15, p. 406]. Let now n = 5 and choose k = 2 (the case n = 4 and k = 2 is treated in [18]). In view of (52) the goal is to evaluate max{|Z . For the proper Zolotarev polynomial Z 5 = Z 5,t we find, again employing Mathematica™, that the condition Z Of these only t * * := t 4 is applicable since it satisfies t * * ∈ J 5 . Hence the largest value of |Z  But similar to the case k = 1 and polynomial (45), t * * cannot be expressed in terms of radicals since the Galois group of (56) is not solvable, as we have checked with the aid of GAP. Among the three negative roots of the equation P m (s) = 0, i.e., s 1 = −1.8058692666..., s 2 = −0.4119616991..., s 3 = t * * , obviously t * * is the one with smallest modulus. Comparing |Z (2) 5,t * * (1)| to |T Having determined (numerically) the optimal parameter t * * , we are in a position to provide, by insertion, the numerical approximations for the coefficients of the Shadrin polynomial Z 5,t * * (for k = 2) as well as for its critical points: and it is readily checked that (55) holds and that Z

Summarizing we have thus established:
Proposition 4. Let t * * denote the negative zero with smallest modulus of the polynomial of degree n = 10 as given in (56), where the numerical value of t * * is given in (54). Let Z 5,t denote the quintic hard-core Zolotarev polynomial. Then, Z 5,t * * is a Shadrin polynomial which solves Shadrin's Markov-type extremal problem to determine (51) for n = 5 and k = 2. The numerical values of its coefficients and of its critical points are given in (61)-(63) and the numerical value of the sought-for maximum M 5,2 is given in (60).
Let now n = 5 and k = 3, so that the goal is to evaluate max{|Z 5,t (1) = 0 (see (36)) renders, likewise as for k = 2, six real (approximate) solutions for t: Of these only t * * * := t 4 is applicable since it satisfies t * * * ∈ J 5 . Hence the largest value of |Z 5,t * * * (1)| = 109.2942452670... . Again one might ask whether t 4 = t * * * can be expressed by radicals of some polynomial equation. In this case the answer is in the positive, since the following minimal polynomial P 6 , which contains t * * * as a zero, has a Galois group which is solvable (as can be checked with GAP): But we shall not dwell on this since it will turn out that Z 5,t * * * , which is approximately given by     Zolotarev's first problem (out of four) calls for a best approximation by polynomials of degree ≤ n−2 to the function f σ , with f σ (x) = x n −nσx n−1 and x ∈ I, or equivalently, calls for a polynomialP n,σ of degree n with fixed first and second leading coefficient, given byP n,σ (x) = x n − nσx n−1 + b n−2 x n−2 + ... + b 1 x + b 0 , which deviates least from the zero function in I, see [2], [25]. Here, σ is a given real number and the deviation is measured in the uniform norm. Equipped with the previous results we are able to solve Zolotarev's first problem, for n = 5, algebraically and even in two fashions, thus avoiding the use of elliptic functions. Our solutions complement and simplify existing algebraic approaches to solve Zolotarev's first problem for n = 5. Note that Zolotarev's first problem extends P. L. Chebyshev's classical approximation problem [19, p. 67 and p. 87], to determine a monic polynomial of degree n which deviates least from the zero function in I, measured in the uniform norm (a solution is 2 1−n T n , which corresponds to σ = 0).
Consider nowP 5,σ with some σ ∈ R\{0}. The goal is to specify, at least numerically, its four variable coefficients b i (i = 0, 1, 2, 3) such that sup x∈I |P 5,σ (x)| becomes least. The following is well known: For 0 < |σ| ≤ tan 2 ( π 10 ) = −t • = 1 − 2/ √ 5 = 0.1055728090... the desired least-deviating quintic polynomial, which is related to an improper quintic Zolotarev polynomial, can be deduced by elementary means, see [2,Th. 1], [15,Th. 1.2.20], where a solution for an arbitrary degree n is displayed. However, for n = 5 and for |σ| > tan 2 ( π 10 ) the desired solution, which is related to a quintic hard-core Zolotarev polynomial, is usually expressed by means of elliptic functions, see [2,Th. 2], [15,Th. 1.2.21], where a solution for an arbitrary degree n is displayed. Schiefermayr [20, p. 156], has established, for arbitrary n and |σ| > tan 2 ( π 2n ), an algebraic solution formula which can be applied immediately provided a subset of the critical points of Z n,t is known, a premise that holds for the case n = 5 under consideration (see Section 2). If the critical points are not known in advance, then an algorithm is advised how to compute that subset. This algorithm, however, requires polynomial equations to be solved which for n ≥ 5 get very bulky [20]. Schiefermayr's solution formula reads for n = 5: A least-deviating polynomialP 5,σ =P 5,σ,ť with σ > tan 2 ( π 10 ) = −t • is given byP meaning that one has first to determine some t =ť ∈ J 5 which solves equation (77) and then to computeP 5,σ,ť (x) with the aid of this value. To apply the formula in this way, the three critical points B 5 (t), C 5 (t) and z 2 (t) of Z 5,t need to be known.
In concluding this Section, we summarize, to the best our knowledge, the currently available constructive approaches to solve Zolotarev's first problem algebraically for n = 5 and for a given σ with |σ| > tan 2 ( π 10 ): (1) M. L. Sodin and P. M. Yuditskii [24] derive the least deviatingP n,σ by representing it by means of involved determinants. No explicit power form representation of the optimalP n,σ and also no explicit example is given. (2) Malyshev [11, pp. 934], too derives the coefficients of the optimalP n,σ by means of determinants, but no explicit power form representation of the optimalP n,σ is given. For n = 5 two auxiliary polynomials U 6,−5σ (of degree 6 in the variable x) and V 6,−5σ (of degree 6 in the variable y) are provided which depend on the parameter −5σ, and hence on σ. For σ = −0.2 the zeros of U 6,1 and V 6,1 are computed and are then employed to determine, by computing certain determinants, the explicit least deviating polynomial with coefficients (86) -(90), see Example 7 above. The reference [24] is not given. [6, p. 15], and [7, pp. 3]. Therefore, the problem to determine an explicit algebraic power form representation of a sextic hard-core Zolotarev polynomial (with six equioscillation points in I) is still open.