<!DOCTYPE html>
<html lang="en">
<head>
<script>
  MathJax = { 
    tex: {
		    inlineMath: [['\\(','\\)']]
	} }
</script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js">
</script>
<meta name="generator" content="plasTeX" />
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<title>Explicit algebraic solution of Zolotarev’s First Problem for low-degree polynomials: Explicit algebraic solution of Zolotarev’s First Problem for low-degree polynomials</title>
<link rel="stylesheet" href="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/styles/theme-white.css" />
</head>

<body>

<div class="wrapper">

<div class="content">
<div class="content-wrapper">


<div class="main-text">



<div class="titlepage">
<h1>Explicit algebraic solution of Zolotarev’s First Problem for low-degree polynomials</h1>
<p class="authors">
<span class="author">Heinz-Joachim Rack\(^\ast \) Robert Vajda\(^\bullet \)</span>
</p>
<p class="date">December 21, 2018; accepted: May 28, 2019; published online: January 31, 2020.</p>
</div>
<p>\(^\ast \)Dr. Rack Consulting GmbH, Steubenstrasse 26a, 58097 Hagen, Germany, e-mail: <span class="tt">heinz-joachim.rack@drrack.com</span> </p>
<p>\(^\bullet \)Bolyai Institute, University of Szeged, Aradi Vertanuk tere 1, 6720 Szeged, Hungary, e-mail: <span class="tt">vajdar@math.u-szeged.hu</span>. The work of this author has been supported by the Ministry of Human Capacities, Hungary, grant 20391-3/2018/FEKUSTRAT and the EU-funded Hungarian grant EFOP-3.6.1-16-2016-00008. </p>
<div class="abstract"><p> E.I. Zolotarev’s classical so-called First Problem (<i class="it">ZFP</i>), which was posed to him by P.L. Chebyshev, is to determine, for a given \(n\in {\mathbb N}\backslash \{ 1\} \) and for a given \(s\in {\mathbb R}\backslash \{ 0\} \), the monic polynomial solution \(Z^{*}_{n,s}\) to the following best approximation problem: Find </p>
<div class="displaymath" id="a0000000002">
  \[  \min _{a_k}\max _{x\in [-1,1]}|a_0+a_1 x+\dots +a_{n-2}x^{n-2}+(-n s)x^{n-1}+x^n|,  \]
</div>
<p> where the \(a_k\), \(0\le k\le n-2\), vary in \(\mathbb R\). It suffices to consider the cases \(s{\gt}\tan ^2\left(\pi /(2n)\right)\). </p>
<p>In 1868 Zolotarev provided a transcendental solution for all \(n\geq 2\) in terms of elliptic functions. An explicit algebraic solution in power form to <i class="it">ZFP</i>, as is suggested by the problem statement, is available only for \(2\le n\le 5\).\({}^{1}\) We have now obtained an explicit algebraic solution to <i class="it">ZFP</i> for \(6\le n\le 12\) in terms of roots of dedicated polynomials. </p>
<p>In this paper, we provide our findings for \(6\le n\le 7\) in two alternative fashions, accompanied by concrete examples. The cases \(8\le n\le 12\) we treat, due to their bulkiness, in a separate web repository. </p>
<p>\(^1\)<i class="it">Added in proof</i>: But see our recent one-parameter power form solution for \(n=6\) in <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	]
</span>. </p>
<p><b class="bf">MSC.</b> 41A10, 41A29, 41A50. </p>
<p><b class="bf">Keywords.</b> Abel-Pell differential equation, algebraic solution, best approximation, Chebyshev, first problem, Groebner basis, least deviation from zero, Malyshev, polynomial, proper, Schiefermayr, two fixed leading coefficients, uniform norm, Zolotarev. </p>
</div>
<h1 id="a0000000003">1 Introduction and historical remarks</h1>
<p>Let \(\boldsymbol {I}=[-1,1]\subset \mathbb {R}\) denote the unit interval and let \(T_n\) denote the \(n\)-th Chebyshev polynomial of the first kind with respect to \(\boldsymbol {I}\). Chebyshev’s classical extremal problem (<i class="it">CEP</i>) of 1854 <span class="cite">
	[
	<a href="#Chebyshev" >8</a>
	]
</span> is to determine among all monic polynomials of degree \(n\ge 1\), given by </p>
<div class="equation" id="degngeneral">
<p>
  <div class="equation_content">
    \begin{equation} \label{degngeneral} P_{n}(x)=\sum _{k=0}^{n-1} a_{k,n}x^{k}+x^n, \end{equation}
  </div>
  <span class="equation_label">1.1</span>
</p>
</div>
<p> where \(a_{k,n}\in {\mathbb R}\) are arbitrary coefficients (and \(a_{n,n}=1\) is fixed), that particular one, call it \(T^{*}_n\), which deviates least from the zero-function on \(\boldsymbol {I}\) measured in the uniform norm \(\Vert \cdot \Vert _{\infty }\). Chebyshev found that the solution \(T^{*}_n\) is given on \(\boldsymbol {I}\) by </p>
<div class="equation" id="Chebn">
<p>
  <div class="equation_content">
    \begin{equation} \label{Chebn} T^{*}_{n}(x)=\sum _{k=0}^{n-1} a^{*}_{k,n}x^{k}+x^n=2^{1-n}T_n(x)=2^{1-n}\cos (n \arccos (x)), \end{equation}
  </div>
  <span class="equation_label">1.2</span>
</p>
</div>
<p> with least deviation \(\Vert T^{*}_n\Vert _{\infty }=2^{1-n}\) and known optimal coefficients \(a^{*}_{k,n}\), see <span class="cite">
	[
	<a href="#Milovanovic" >25</a>
	, 
	p. 384
	]
</span> or <span class="cite">
	[
	<a href="#Rivlin74" >39</a>
	, 
	p. 6, p. 67
	]
</span> for details. </p>
<p>In 1867 Chebyshev himself proposed to his student Zolotarev, see <span class="cite">
	[
	<a href="#Zolotarev1877" >52</a>
	, 
	p. 2
	]
</span>, an extension of <i class="it">CEP</i> by requiring that not only the first but also the second leading coefficient, \(a_{n-1,n}\), is to be kept fixed. This extended <i class="it">CEP</i>, which was later renamed as Zolotarev’s first problem (<i class="it">ZFP</i>), can be stated as follows: </p>
<p><em>To determine among all polynomials of degree \(n\ge 2\), represented as</em> </p>
<div class="equation" id="degnmonic">
<p>
  <div class="equation_content">
    \begin{equation} \label{degnmonic} P_{n,s}(x)=\sum _{k=0}^{n-2} a_{k,n}x^{k}+(-n s)x^{n-1}+x^n \end{equation}
  </div>
  <span class="equation_label">1.3</span>
</p>
</div>
<p> <em>where \(s\in \mathbb {R}\backslash \{ 0\} \) is prescribed, that particular one, call it \(Z^{*}_{n,s}\), with</em> </p>
<div class="equation" id="dnZol1">
<p>
  <div class="equation_content">
    \begin{equation} \label{dnZol1} Z^{*}_{n,s}(x)=\sum _{k=0}^{n-2} a^{*}_{k,n}(s)x^{k}+(-n s)x^{n-1}+x^n, \end{equation}
  </div>
  <span class="equation_label">1.4</span>
</p>
</div>
<p> <em>which deviates least from the zero-function on \(\boldsymbol {I}\) in the uniform norm \(\Vert \cdot \Vert _{\infty }\)</em>. </p>
<p>Or put alternatively, the goal is to determine, for a prescribed \(s\), the best uniform approximation on \(\boldsymbol {I}\) to \((-n s)x^{n-1}+x^n\) by polynomials of degree \({\lt}n-1\). It is well-known that one may restrict the parameter \(s\) to \(s{\gt}0\), and that for \(0{\lt}s\le \tan ^2\left(\pi /(2n)\right)\) the solution is given by a distorted \(T^{*}_n\) (see <i class="it">e.g.</i> <span class="cite">
	[
	<a href="#Achieser98" >1</a>
	, 
	p. 16
	]
</span>, <span class="cite">
	[
	<a href="#Achieser03" >2</a>
	, 
	p. 280
	]
</span>, <span class="cite">
	[
	<a href="#Carlson83" >7</a>
	]
</span>, <span class="cite">
	[
	<a href="#Milovanovic" >25</a>
	, 
	p. 405
	]
</span> for details), and is called an <em>improper monic Zolotarev polynomial</em>. However, for \(s{\gt}\tan ^2\left(\pi /(2n)\right)\), the solution \(Z^{*}_{n,s}\) to <i class="it">ZFP</i> is considered as very complicated (see <i class="it">e.g.</i> <span class="cite">
	[
	<a href="#Carlson83" >7</a>
	]
</span>, <span class="cite">
	[
	<a href="#Milovanovic" >25</a>
	, 
	p. 407
	]
</span>, <span class="cite">
	[
	<a href="#Peherstorfer91" >28</a>
	]
</span>) or even as mysterious <span class="cite">
	[
	<a href="#Todd84" >47</a>
	]
</span>, and is called <em>a proper</em> <span class="cite">
	[
	<a href="#Voronovskaja70" >49</a>
	, 
	p. 160
	]
</span>, or <em>hard-core</em> <span class="cite">
	[
	<a href="#Rivlin75" >40</a>
	]
</span> <em>monic Zolotarev polynomial</em>. Here we shall confine ourselves to proper monic Zolotarev polynomials, noting that \(0{\lt}\tan ^2\left(\pi /(2n)\right){\lt}1\) holds for \(n{\gt}2\), and writing \(Z_{n,s}\) in place of \(Z^{*}_{n,s}\), if \(s{\gt}\tan ^2\left(\pi /(2n)\right)\) is not specified. </p>
<p>Zolotarev provided a solution to <i class="it">ZFP</i> in 1868 <span class="cite">
	[
	<a href="#Zolotarev1868" >51</a>
	]
</span>, and in a reworked form in 1877 <span class="cite">
	[
	<a href="#Zolotarev1877" >52</a>
	]
</span>, where he was considering altogether four extremal problems, of which <i class="it">ZFP</i> was the first in the row (hence the name). Much to the surprise of his contemporaries, as well as of today’s students, Zolotarev presented the proper \(Z_{n,s}\) in terms of elliptic functions (see <i class="it">e.g.</i> <span class="cite">
	[
	<a href="#Achieser98" >1</a>
	, 
	p. 18
	]
</span>, <span class="cite">
	[
	<a href="#Achieser03" >2</a>
	, 
	p. 280
	]
</span>, <span class="cite">
	[
	<a href="#Carlson83" >7</a>
	]
</span>, <span class="cite">
	[
	<a href="#Erdos42" >10</a>
	]
</span>, <span class="cite">
	[
	<a href="#Milovanovic" >25</a>
	, 
	p. 407
	]
</span>, <span class="cite">
	[
	<a href="#Peherstorfer04" >31</a>
	]
</span>) rather than, as is suggested by the task, in terms of explicit optimal coefficients of an algebraic polynomial in power form. When compared to the two-fold solution (<a href="#Chebn">1.2</a>) of <i class="it">CEP</i>, Zolotarev’s <em>unwieldy</em> <span class="cite">
	[
	<a href="#Tikhomirov" >46</a>
	, 
	p. 118
	]
</span> elliptic (or transcendental) solution of <i class="it">ZFP</i> would correspond to the trigonometric right-hand solution in (<a href="#Chebn">1.2</a>) without providing an equivalent algebraic left-hand term. The following statement by A. A. Markov <span class="cite">
	[
	<a href="#AAMarkov1906" >23</a>
	, 
	p. 264
	]
</span> indicates a reservation about Zolotarev’s elliptic solution: <em>Being based on the application of elliptic functions, Zolotarev’s solution is too complicated to be useful in practice</em>. </p>
<p>It is tempting to derive an algebraic solution to <i class="it">ZFP</i> from the elliptic solution. However, even for the first reasonable polynomial degree \(n=2\) this path turns out be unexpectedly complicated, see <span class="cite">
	[
	<a href="#Carlson83" >7</a>
	]
</span> for details. Therefore, alternative solution paths have been pursued to determine the proper \(Z_{n,s}\) algebraically. For example, <em>A. A. Markov himself tried to employ the theory of continued fractions in order to find an algebraic solution [to <i class="it">ZFP</i>], but he was not fully successful, because an algebraic solution requires an amazing amount of calculations</em>, as is remarked in <span class="cite">
	[
	<a href="#Malyshev02" >20</a>
	, 
	p.
	
	932
	]
</span>. Actually, explicit algebraic solutions to <i class="it">ZFP</i> (in terms of parameterized coefficients) are known only for polynomial degrees \(2\le n\le 5\), see Section <a href="#Known25">2</a>. <i class="it">Added in proof</i>: But see our recent one-parameter power form solution for \(n=6\) in <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	]
</span>. </p>
<p>The purpose of the present paper is to provide new explicit algebraic solutions to <i class="it">ZFP</i> for polynomial degrees \(6\le n\le 12\). To this end, we shall explore in some detail two different solution paths for \(n=6\) and for \(n=7\). The first one is based on the Abel-Pell differential equation which must be satisfied by \(Z_{n,s}\) and computes Groebner bases with the computer algebra system <em>Mathematica™</em> <span class="cite">
	[
	<a href="#MMA1" >50</a>
	]
</span> to actually construct it. The second solution path, also backed by <em>Mathematica</em>, expresses \(Z_{n,s}\) tentatively as \(Z_{n,\alpha ,\beta }\), a form which depends on two parameters \(\alpha \) and \(\beta \), so that \(Z_{n,\alpha ,\beta }\) can be stored, once and for all, in an electronic library. Upon assigning a fixed \(s{\gt}\tan ^2\left(\pi /(2n)\right)\), \(\alpha \) and \(\beta \) can then be conveyed to real numbers so that \(Z_{n,\alpha ,\beta }\) turns into \(Z^{*}_{n,s}\). Both of our approaches have in common that for a given \(s\in \mathbb {Q}\) the optimal coefficients of \(Z^{*}_{n,s}\) can be expressed explicitly by means of root objects of dedicated integer polynomials. Because of the growing bulkiness of the intermediate results needed to compute \(Z_{n,s}\) where \(n\ge 8\), we will transfer our findings for the polynomial degrees \(8\le n\le 12\) to a web repository <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span>, see also Section <a href="#hosection">6</a>. </p>
<p>Ours is not the first investigation of an algebraic solution to <i class="it">ZFP</i>. In 2004 A. Shadrin <span class="cite">
	[
	<a href="#Shadrin04" >42</a>
	]
</span> remarked: <em>Recently, the interest in an explicit algebraic solution of <i class="it">ZFP</i> was revived in the papers <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span>, <span class="cite">
	[
	<a href="#Peherstorfer90" >27</a>
	]
</span>, <span class="cite">
	[
	<a href="#Yuditskii95" >45</a>
	]
</span>, but it is only Malyshev who demonstrates how his theory can be applied to some explicit constructions for particular \(n\)</em>. But actually V. A. Malyshev <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span>, see also <span class="cite">
	[
	<a href="#Malyshev02" >20</a>
	]
</span>, provided explicit constructions only for \(2\le n\le 5\) by deploying certain pairs of polynomials, parameterized by \(s\), which are key to the determination of the parameters \(\alpha \) and \(\beta \) when \(s\) is prescribed. We coin them Malyshev polynomials and will be taking advantage of them in our solution. To this end, we will have to calculate their coefficients for \(6\le n\le 12\). Malyshev <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span> had predicted (correctly, as we have now verified) only their degrees for \(6\le n\le 8\), but did not communicate their coefficients. Further papers relevant to <i class="it">ZFP</i> are <span class="cite">
	[
	<a href="#Lebedev94" >18</a>
	]
</span>, <span class="cite">
	[
	<a href="#Peherstorfer99a" >29</a>
	]
</span>, <span class="cite">
	[
	<a href="#Peherstorfer99b" >30</a>
	]
</span>, <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span> and <span class="cite">
	[
	<a href="#Yuditskii93" >44</a>
	]
</span>, see also Section <a href="#Known25">2</a>. We have benefited from <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span> where a methodical algebraic approach to <i class="it">ZFP</i> based on well-defined determinants is provided: A tentative expression of \(Z_{n,s}\) is given in the parametric form \(Z_{n,\alpha ,\beta , y_1,\dots ,y_m}\) and algorithmic steps are delineated how to compute the parameters. By modifying these steps, we eliminate the parameters \(y_1,\dots ,y_m\). The remaining parameters \(\alpha \) and \(\beta \) we then determine as roots of the Malyshev polynomials and that eventually leads to \(Z_{n,s}\). </p>
<p>The provision of a solution to <i class="it">ZFP</i> for \(n{\gt}5\) via computer algebra methods has been stated as an open problem in <span class="cite">
	[
	<a href="#Kaltofen" >16</a>
	]
</span>. Based on an advanced computer algebra strategy, the conference paper <span class="cite">
	[
	<a href="#Lazard" >17</a>
	]
</span> claims to have algebraically solved <i class="it">ZFP</i> for \(6\le n\le 12\). We do not share this view, since the theoretical strategy in <span class="cite">
	[
	<a href="#Lazard" >17</a>
	]
</span> appears not granulated finely enough for the purpose of enabling the construction of \(Z^{*}_{n,s}\) for a given \(n\) and \(s\) (<i class="it">e.g.</i> \(n=6\) and \(s=1/8\), see our example below), the more so as no concrete solution formulas are provided in <span class="cite">
	[
	<a href="#Lazard" >17</a>
	]
</span>. But we leave it to the reader to form an opinion. </p>
<p>We point out that in none of the references quoted in the present paper the following of our findings, for \(6\le n\le 12\), are revealed: Explicit tentative representations \(Z_{n,\alpha ,\beta }\) of \(Z_{n,s}\), explicit coefficients of the Malyshev polynomials, granulated algorithmic steps (accompanied by examples) for the recursive or direct creation of the optimal coefficients \(a_{k,n}(s)\) of \(Z_{n,s}\), and a representation of the \(a_{k,n}(s)\) as root objects of dedicated integer polynomials if \(s\in \mathbb {Q}\). </p>
<p>The first-named author has presented a poster on <i class="it">ZFP</i> at the IX Jaen Conference on Approximation Theory (Spain, July 2018) <span class="cite">
	[
	<a href="#Rack18" >36</a>
	]
</span> and each of us has given a talk on <i class="it">ZFP</i> at the Fourth International Conference on Numerical Analysis and Approximation Theory (NAAT, Cluj-Napoca, Romania, September 2018) <span class="cite">
	[
	<a href="#Rack18b" >37</a>
	, 
	<a href="#Vajda18" >48</a>
	]
</span>. We have agreed to publish our individual findings in a joint manuscript. </p>
<h1 id="Known25">2 Known explicit algebraic solutions to <i class="it">ZFP</i> for \(2\leq n\leq 5\)</h1>

<p>The demand for a description of the solution to <i class="it">ZFP</i> without elliptic functions has been vibrant from the outset. Scaled proper Zolotarev polynomials, for \(2\le n\le 4\), given in an algebraic power form, found application already in the proof of the famous Markov inequalities <span class="cite">
	[
	<a href="#AAMarkov1889" >22</a>
	]
</span>, <span class="cite">
	[
	<a href="#VAMarkov" >24</a>
	]
</span>. Algebraic expressions for scaled proper Zolotarev polynomials (with uniform norm \(1\) on \(\boldsymbol {I}\)) for \(2\le n\le 4\) can be found in <span class="cite">
	[
	<a href="#Carlson83" >7</a>
	]
</span>, <span class="cite">
	[
	<a href="#Collins96" >9</a>
	]
</span>, <span class="cite">
	[
	<a href="#Grasegger16a" >12</a>
	]
</span>, <span class="cite">
	[
	<a href="#Grasegger16b" >13</a>
	]
</span>, <span class="cite">
	[
	<a href="#Grasegger17" >14</a>
	]
</span>, <span class="cite">
	[
	<a href="#Lebedev94" >18</a>
	]
</span>, <span class="cite">
	[
	<a href="#Paszkowski62" >26</a>
	, 
	p. 156
	]
</span>, <span class="cite">
	[
	<a href="#Rack89" >33</a>
	]
</span>, <span class="cite">
	[
	<a href="#Rack17b" >35</a>
	]
</span>, <span class="cite">
	[
	<a href="#Shadrin04" >42</a>
	]
</span>, <span class="cite">
	[
	<a href="#Voronovskaja70" >49</a>
	, 
	p. 98
	]
</span> (the latter with respect to \([0, 1]\)). The case \(n=4\) (rational parametrization) is of particular interest, see <span class="cite">
	[
	<a href="#Rack17a" >34</a>
	, 
	p. 160
	]
</span>. </p>
<p>The case \(n=5\) (radical parametrization) has been settled only quite recently in <span class="cite">
	[
	<a href="#Grasegger16a" >12</a>
	]
</span>, <span class="cite">
	[
	<a href="#Grasegger16b" >13</a>
	]
</span>, <span class="cite">
	[
	<a href="#Grasegger17" >14</a>
	]
</span>, see also <span class="cite">
	[
	<a href="#Rack17b" >35</a>
	]
</span>. A partial result for \(n=5\) is due to&#160;<span class="cite">
	[
	<a href="#Collins96" >9</a>
	]
</span>. </p>
<p>These polynomials, whose coefficients depend injectively on one parameter, </p>
<p>are expressed, for \(2\le n\le 5\), in the analytic form </p>
<div class="equation" id="parform25">
<p>
  <div class="equation_content">
    \begin{equation} \label{parform25} \sum _{k=0}^{n} a_{k,n}(t) x^k, \quad {\rm with}\quad a_{n,n}(t)\neq 0 \quad {\rm and\, \,  parameter} \quad t\in I_n, \end{equation}
  </div>
  <span class="equation_label">2.1</span>
</p>
</div>
<p> where \(I_n\) denotes a dedicated open interval. To deduce, for a given \(s{\gt}\tan ^2\left(\pi /(2n)\right)\), from (<a href="#parform25">2.1</a>) a proper Zolotarev polynomial \(Z^{*}_{n,s}\) according to (<a href="#dnZol1">1.4</a>), one may proceed as follows (see also <span class="cite">
	[
	<a href="#Erdos42" >10</a>
	, 
	Theorem 3
	]
</span>): Divide (<a href="#parform25">2.1</a>) by the coefficient \(a_{n,n}(t)\) yielding \(\sum _{k=0}^{n-1} b_{k,n}(t) x^k + x^n\); then equate \(b_{n-1,n}(t)\) with \((-ns)\) and solve for \(t\); insert the solution \(t=t^{*} \in I_n\) into \(\sum _{k=0}^{n-1} b_{k,n}(t) x^k + x^n\) to get \(Z^{*}_{n,s}\). An example of such a deduction, for \(n=5\) and \(s=2\), is given in <span class="cite">
	[
	<a href="#Rack17b" >35</a>
	, 
	Chapter 5
	]
</span>. To determine \(Z^{*}_{n,s}\) for a given \(n{\gt}5\) and for an assigned fixed \(s{\gt}\tan ^2\left(\pi /(2n)\right)\) in the way just sketched would be an elegant path to solve <i class="it">ZFP</i> avoiding elliptic functions. However, to the best of our knowledge, analytical forms (<a href="#parform25">2.1</a>) for (scaled) proper Zolotarev polynomials currently do not exist if \(n{\gt}5\), see also <span class="cite">
	[
	<a href="#Shadrin14" >43</a>
	, 
	p. 1185
	]
</span>. <i class="it">Added in proof</i>: But see our recent one-parameter power form solution for \(n=6\) in <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	]
</span>. </p>
<p>Regrettably, the contrary is claimed elsewhere. But the sextic scaled monic polynomial given in <span class="cite">
	[
	<a href="#Grasegger17" >14</a>
	, 
	Section 4.5
	]
</span>, (see also <span class="cite">
	[
	<a href="#Grasegger16a" >12</a>
	, 
	Section 4.5
	]
</span>) and the composition of Chebyshev with scaled proper Zolotarev polynomials, as given in <span class="cite">
	[
	<a href="#Grasegger17" >14</a>
	, 
	Corollary 4.3
	]
</span>, (see also <span class="cite">
	[
	<a href="#Grasegger16b" >13</a>
	, 
	Corollary 2.2
	]
</span>, and <span class="cite">
	[
	<a href="#Rack17b" >35</a>
	, 
	Remark 9
	]
</span>), do not alternate on \(\boldsymbol {I}\) exactly as many times as the degree indicates, and hence they cannot be proper (scaled) Zolotarev polynomials, see also Section <a href="#prelimsection">3</a> below. </p>
<h1 id="prelimsection">3 Preliminaries</h1>

<p>It is well known (see <i class="it">e.g.</i> <span class="cite">
	[
	<a href="#Achieser03" >2</a>
	]
</span>, <span class="cite">
	[
	<a href="#Erdos42" >10</a>
	]
</span>, <span class="cite">
	[
	<a href="#Shadrin04" >42</a>
	]
</span>, <span class="cite">
	[
	<a href="#Yuditskii95" >45</a>
	]
</span>) that a proper monic Zolotarev polynomial \(Z_{n,s}\) (where \(s{\gt}\tan ^2\left(\pi /(2n)\right)\)) has \(n\) equioscillation points on \(\boldsymbol {I}\), including the endpoints \(\pm 1\), at which it takes its uniform norm \(L:=\Vert Z_{n,s}\Vert _{\infty }\) with alternating sign. For definiteness we assume that in particular, at \(x=-1\) the value \((-1)^n L\) is attained and at \(x=1\) the value \(-L\) is attained. Additionally, there exists an interval \([\alpha ,\beta ]\) with </p>
<div class="equation" id="a0000000004">
<p>
  <div class="equation_content">
    \begin{equation}  1<\alpha =\alpha (s)<\beta =\beta (s) \quad {\rm and}\quad \beta >1+2\tan ^2\left(\tfrac {\pi }{2n}\right) \end{equation}
  </div>
  <span class="equation_label">3.1</span>
</p>
</div>
<p> such that at \(x=\alpha \) the value \(-L\) is attained and at \(x=\beta \) the value \(L\) is attained, and at </p>
<div class="equation" id="a0000000005">
<p>
  <div class="equation_content">
    \begin{equation}  x=\gamma :=(\alpha +\beta -2s)/2 \quad {\rm with}\quad 1<\gamma <\alpha \end{equation}
  </div>
  <span class="equation_label">3.2</span>
</p>
</div>
<p> there vanishes \(Z'_{n,s}\), the first derivative of \(Z_{n,s}\) with respect to \(x\). Thus on \(\boldsymbol {I}\cup [\alpha ,\beta ]\) we have \((Z_{n,s})^2\le L^2\), and \((Z_{n,s})^2{\gt} L^2\) on \(\mathbb {R}\backslash (\boldsymbol {I}\cup [\alpha ,\beta ])\). </p>
<p>Furthermore, \(Z_{n,s}\) satisfies the following so-called Abel-Pell differential equation: </p>
<div class="equation" id="DEna">
<p>
  <div class="equation_content">
    \begin{equation} \label{DEna} \tfrac {(1-x^2)(x-\alpha )(x-\beta )(Z_{n,s}’(x))^2}{n^2 (x-\gamma )^2} =L^2-(Z_{n,s}(x))^2. \end{equation}
  </div>
  <span class="equation_label">3.3</span>
</p>
</div>
<p>We introduce for \(n\in N=\{ 6,7,8,9,10,11,12\} \) new polynomials \(F_{m(n),s}\), \(G_{m(n),s}\) which depend on \(s\) and whose degree \(m(n)\) depends on \(n\in N\), see also Section <a href="#hosection">6</a> below. They are an outcome of our proofs and we term them Malyshev polynomials because related polynomials appeared first in <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span> in connection with <i class="it">ZFP</i>, but only for \(n\in \{ 2,3,4,5\} \) and somehow unmotivated since in <span class="cite">
	[
	<a href="#Malyshev02" >20</a>
	]
</span> different polynomials were used. The coefficients, and hence the degrees, of \(F_{m(n),s}\) and \(G_{m(n),s}\) as given below and in <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span>, verify that Malyshev in <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span> has predicted correctly the degrees \(m(n)\) for \(n\in \{ 6,7,8\} \) as well as a <em>curious</em> skew-symmetry relating \(F_{m(n),s}\) to \(G_{m(n),s}\), if \(n\in N\) is even: </p>
<div class="displaymath" id="a0000000006">
  \begin{align} & F_{m(6),s}= F_{8,s} \quad {\rm with} \nonumber \\ & F_{8,s}(\alpha )= \label{F8a}\\ &  =(-59 + 2000 s - 34688 s^2 - 16128 s^3 - 318816 s^4 \nonumber \\ & -3960576 s^5 - 2861568 s^6 - 1492992 s^7 + 186624 s^8) \nonumber \\ & +(-376 + 16976 s + 57792 s^2 - 220800 s^3 \nonumber \\ & +3162240 s^4 + 3117312 s^5 - 995328 s^6 - 995328 s^7) \alpha \nonumber \\ & +(- 2564 -18672 s + 284160 s^2 - 637440 s^3\nonumber \\ & -1873728 s^4 + 4154112 s^5 + 2280960 s^6) \alpha ^2 \nonumber \\ & +(1816 - 89584 s - 39296 s^2 \nonumber \\ & +1278720 s^3 - 2888064 s^4 - 2923776 s^5) \alpha ^3 \nonumber \\ & +(8558 + 27248 s - 589440 s^2 + 705792 s^3 + 2282400 s^4) \alpha ^4 \nonumber \\ & +(-2312 + 121584 s - 22080 s^2 - 1104000 s^3) \alpha ^5 \nonumber \\ & +(-8932 - 11600 s + 320000 s^2) \alpha ^6 + (1000 - 50000 s) \alpha ^7 + 3125 \alpha ^8. \nonumber \end{align}
</div>
<div class="equation" id="G8a">
<p>
  <div class="equation_content">
    \begin{equation} \label{G8a} G_{m(6),s}=G_{8,s} \quad {\rm with}\quad G_{8,s}(\beta )=F_{8,-s}(-\beta ). \end{equation}
  </div>
  <span class="equation_label">3.5</span>
</p>
</div>
<div class="displaymath" id="a0000000007">
  \begin{align} & F_{m(7),s}=F_{12,s} \quad {\rm with} \nonumber \\ & F_{12,s}(\alpha )= \label{F12a}\\ & =1792 + 163072 s^2 + 8410752 s^4 - 376438384 s^6 + 2733221568 s^8 \nonumber \\ & +2029209952 s^{10} - 282475249 s^{12} + (64512 s - 1436288 s^3 \nonumber \\ & +447392736 s^5 - 6100537632 s^7 - 322828856 s^9 + 1129900996 s^{11}) \alpha \nonumber \\ & +(-19712 + 1728384 s^2 - 223227536 s^4 + 5813877440 s^6 \nonumber \\ &  -7355415480 s^8 - 1395081842 s^{10}) \alpha ^2 + (-868224 s \nonumber \\ & +78809024 s^3 - 3231784416 s^5 + 12151057632 s^7 - 668716916 s^9) \alpha ^3 \nonumber \\ & +(100864 - 23298576 s^2 + 1235270400 s^4 - 9953009360 s^6 \nonumber \\ &  +4106538345 s^8) \alpha ^4 + (4101216 s - 351315552 s^3 + 5195725584 s^5 - \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000008">
  \begin{align} & -5802179768 s^7) \alpha ^5 + (-279792 + 70263872 s^2 - 1874768224 s^4 \nonumber \\ & +4661407044 s^6) \alpha ^6 + (-8268960 s + 469393568 s^3 - 2424683464 s^5) \alpha ^7 \nonumber \\ & +(410688 - 77006160 s^2 + 843673425 s^4) \alpha ^8 + (7295400 s \! -\!  194631500 s^3) \nonumber \\ &  \alpha ^9 +(-297000 + 28428750 s^2) \alpha ^{10} - 2362500 s \alpha ^{11}+84375 \alpha ^{12}. \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000009">
  \begin{align} & G_{m(7),s}=G_{12,s} \quad {\rm with} \nonumber \\ & G_{12,s}(\beta )= \label{G12a}\\ & =565504 - 102271232 s^2 + 3016577984 s^4 + 196082294128 s^6 \nonumber \\ &  -158647323520 s^8 + 571729903976 s^{10} + 13841287201 s^{12} \nonumber \\ & + (74400256 s - 6755815808 s^3 - 186738408864 s^5 \nonumber \\ & +874115128544 s^7 - 1168317629864 s^9 + 55365148804 s^{11}) \beta \nonumber \\ & +(-10513664 + 4103042048 s^2 + 22357074768 s^4 - 1148314476288 s^6 \nonumber \\ & +1805996857280 s^8 - 485292477782 s^{10}) \beta ^2 + (-953905792 s \nonumber \\ &  +34684357568 s^3 + 570329544736 s^5 - 2201060316896 s^7 \nonumber \\ &  + 1228202382652 s^9) \beta ^3 + (78266944 - 16893148272 s^2 \nonumber \\ &  - 43921473792 s^4 + 1570190613600 s^6 - 1640714247809 s^8) \beta ^4 \nonumber \\ & + (3041893344 s - 65016346976 s^3 - 537505339280 s^5 \nonumber \\ & +1310441386632 s^7) \beta ^5 + (-196530768 + 26344802176 s^2 \nonumber \\ &  +14921350640 s^4 - 627807535124 s^6) \beta ^6 + (-4059208608 s \nonumber \\ & + 52325237216 s^3 + 152679225048 s^5) \beta ^7 + (229065984 \! -\!  17822979720 s^2 \nonumber \\ &  + 4354873775 s^4) \beta ^8 + (2480095800 s - 14912439500 s^3) \beta ^9 \nonumber \\ &  +(-129654000 + 4425986250 s^2) \beta ^{10} - 578812500 s \beta ^{11} +28940625 \beta ^{12}. \nonumber \end{align}
</div>
<p>Furthermore, we shall need, for the description of the case \(n=7\), the following polynomials \(H_{22}\) and \(K_{9,s,\beta }\) of degree 22 respectively 9, given by: </p>
<div class="displaymath" id="H22">
  \begin{align}  H_{22}(s)= &  -1852140918261583566501829703 \label{H22}\\ &  +171585036770132443429137970874 s^2 \nonumber \\ & + 2930085129784195818098662450718 s^4 \nonumber \\ &  -473949851650913723472627359963298 s^6 \nonumber \\ &  - 1585996952444813524706539216972904 s^8 \nonumber \\ &  +366512197633009736432152719309634722 s^{10} \nonumber \\ &  +1650042285262881985677338126342078930 s^{12} \nonumber \\ &  +3112847096718540855667326636507713306 s^{14} - \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000010">
  \begin{align} &  -18636143487984483194506534138649825 s^{16} \nonumber \\ & + 84095343008722987455587706968148716 s^{18} \nonumber \\ &  -10611056498918269743170304104511456 s^{20} \nonumber \\ & + 532346879028669698329938821906624 s^{22}, \nonumber \end{align}
</div>
<div class="displaymath" id="K9">
  \begin{align} & K_{9,s,\beta }(\alpha )= \label{K9}\\ & 1792 s - 256 \beta - 3584 s \beta ^2 + 256 \beta ^3 + 1120 s \beta ^4 + 32 \beta ^5 + 448 s \beta ^6 - 112 \beta ^7 \nonumber \\ & -21 s \beta ^8 + 7 \beta ^9 + \alpha (-512 + 256 \beta ^2 - 2688 s \beta ^3 + 256 \beta ^4 + 1344 s \beta ^5 - 272 \beta ^6 \nonumber \\ &  +56 s \beta ^7 - 14 \beta ^8)+\alpha ^2 (-3584 s - 256 \beta + 3136 s \beta ^2 - 64 \beta ^3 - 2240 s \beta ^4 + 80 \beta ^5 \nonumber \\ &  +84 s \beta ^6 - 28 \beta ^7)+\alpha ^3 (768 - 2688 s \beta - 896 \beta ^2 + 896 s \beta ^3 + 368 \beta ^4 - 504 s \beta ^5 \nonumber \\ & + 80 \beta ^6) +\alpha ^4 (1120 s + 800 \beta - 2240 s \beta ^2 - 80 \beta ^3 + 770 s \beta ^4 + 10 \beta ^5)+\alpha ^5 (-128 \nonumber \\ &  +1344 s \beta + 592 \beta ^2 - 504 s \beta ^3 - 172 \beta ^4)+\alpha ^6 (448 s - 400 \beta + 84 s \beta ^2 + 164 \beta ^3) \nonumber \\ & +\alpha ^7 (-176 + 56 s \beta - 32 \beta ^2)+\alpha ^8 (-21 s - 25 \beta )+10\alpha ^{9}. \nonumber \end{align}
</div>
<h1 id="a0000000011">4 Explicit algebraic solution to <i class="it">ZFP</i> for polynomials of &#8195;&#8195;&#8195;&#8195;&#8195;&#8195;&#8195;&#8195;&#8195;&#8195;degree \(n = 6\)</h1>
<h2 id="subsection61">4.1 First solution path: Abel-Pell differential equation and Groebner basis</h2>

<p>This approach builds on the Abel-Pell differential equation representation of the sought-for proper Zolotarev polynomial \(Z_{n,s}\), see (<a href="#DEna">3.3</a>). This representation was used, although for a slightly different purpose, in <span class="cite">
	[
	<a href="#Grasegger16a" >12</a>
	]
</span>. In this respect it differs from the approach taken in <span class="cite">
	[
	<a href="#Collins96" >9</a>
	, 
	<a href="#Lazard" >17</a>
	]
</span>, where the characterization of the optimal polynomial was based on the inner equioscillation points, although it shares with the latter the computational strategy that it considers first the variety which contains the semialgebraically definable solution. The Abel-Pell differential equation gives rise to a system of multivariate polynomials. Its properties are investigated with Groebner basis computations <span class="cite">
	[
	<a href="#Buchberger" >6</a>
	]
</span>. It will turn out that for each of the parameters, the ideal in the associated polynomial ring is zero-dimensional and with a semialgebraic extra condition one can select the proper solution to <i class="it">ZFP</i> among the finitely many candidates. </p>
<p>Let \(s{\gt}\tan ^2\left(\pi /12\right)(=7-4\sqrt3=0.07179\dots )\) be arbitrary, but fixed. We search for the solution of <i class="it">ZFP</i> in the form </p>
<div class="equation" id="d6Zol01">
<p>
  <div class="equation_content">
    \begin{equation} \label{d6Zol01} P_{6a,s}(x)=a_0+a_1 x+a_2 x^2+a_3 x^3+a_4 x^4+(-6s)x^5+x^6. \end{equation}
  </div>
  <span class="equation_label">4.1</span>
</p>
</div>
<p> Let \(L\) be the uniform norm of \(P_{6a,s}\) on \(\boldsymbol {I}\). By using the fact that for the solution to <i class="it">ZFP</i> we have \(P_{6a,s}(1)=-L, P_{6a,s}(-1)=L\), we may consider </p>
<div class="displaymath" id="d6Zol02">
  \begin{align} & P_{6,s}(x)= \label{d6Zol02} (\! -\! 1\! -\! a_2\! -\! a_4)+(\! -\! a_3\! -\! L+6s) x+a_2 x^2+a_3 x^3+a_4 x^4+(-6s)x^5+x^6. \end{align}
</div>
<p>If \(\beta {\gt}\alpha {\gt}1\) denotes the uniquely existing points where \(P_{6,s}(\alpha )=-L\) and \(P_{6,s}(\beta )=L\), then it is known that the sought-for polynomial satisfies the differential equation (<a href="#DEna">3.3</a>), here for \(n=6\): </p>
<div class="equation" id="DE6a">
<p>
  <div class="equation_content">
    \begin{equation} \label{DE6a} (1-x^2)\tfrac {(x-\alpha )(x-\beta )}{36 (x-(1/2)(\alpha +\beta -2s))^2} (P_{6,s}'(x))^2=L^2-(P_{6,s}(x))^2. \end{equation}
  </div>
  <span class="equation_label">4.3</span>
</p>
</div>
<p> By clearing denominators and by a coefficient-comparison we get polynomial equations in \(s,\alpha ,\beta ,L,a_2,a_3,a_4\). To be able to distinguish between \(\alpha \) and \(\beta \) we add the constraints \(P_{6,s}(\alpha )=-L, P_{6,s}(\beta )=L\) to the system. By reducing the equations to zero, we are left with a system \(Q6=\{ q_{601},\dots ,q_{615}\} \) consisting of 15 polynomials. We then compute a lexicographic Groebner basis (with <em>Mathematica</em>) for \(Q6\). As a result, we obtain that for each particular \(s\) the ideal generated by \(Q6\) is a zero-dimensional ideal and if we choose that variable order where \(s\) and \(\alpha \) are the smallest in the ordering, we get a polynomial as the first element of the basis which splits into two factors: </p>
<div class="equation" id="GB611a">
<p>
  <div class="equation_content">
    \begin{equation} \label{GB611a} (2s-1-\alpha ), \end{equation}
  </div>
  <span class="equation_label">4.4</span>
</p>
</div>
<p> and the factor \(F_{8,s}\) given in (<a href="#F8a">3.4</a>). </p>
<p>The first factor, (<a href="#GB611a">4.4</a>), leads to a rational solution of the differential equation (<a href="#DE6a">4.3</a>): </p>
<div class="displaymath" id="a0000000012">
  \begin{align}  (-1 + 3 s^2) + (-6 s + 6 s^3) x + (3 - 15 s^2) x^2 \\ +(12 s - 8 s^3) x^3 + (-3 + 12 s^2) x^4 - 6 s x^5 + x^6, \nonumber \end{align}
</div>
<p> but this polynomial cannot be the proper solution of <i class="it">ZFP</i>, because it has less than four inner equioscillation points in \(\boldsymbol {I}\). So we consider the second factor, \(F_{8,s}\). For \(s\) fixed, \(\alpha \) must be chosen to be the largest, that is, the second, real root of \(F_{8,s}\), to obtain the solution to <i class="it">ZFP</i>. For \(s{\lt}1/3\), there is definitely no other choice for \(\alpha \), because then \(F_{8,s}\) has only one real root \({\gt}1\) (this can be confirmed with the <b class="bf">CylindricalDecomposition</b> call in <em>Mathematica</em>). By continuity arguments we see, that this is the case also for \(s{\gt}1/3\) and that the uppermost branch of the real algebraic curve \(F_{8,s}=0\) must be taken for the construction of the extremal polynomial (see Fig. <a href="#figure:1">1</a>). </p>
<figure id="figure:1">
  <div class="centered"> <img src="img-0001.png" alt="\includegraphics[width=5cm]{GraphForZol1a.png}" style="width:5cm" />
 <figcaption>
  <span class="caption_title">Figure</span> 
  <span class="caption_ref">1</span> 
  <span class="caption_text">Largest positive root of \(F_{8,s}\).</span> 
</figcaption> </div>

</figure>
<p> We adopt, here and in what follows, the <em>Mathematica</em> notation \({\rm Root[}f,k{\rm ]}\) for the \(k\)-th root of \(f\). With this notation, \(\alpha ={\rm Root[}F_{8,s},2{\rm ]}\). Not only \(\alpha \), but also all the coefficients, the norm \(L\) and the other outer equiscillation point \(\beta \) are uniquely determined by \(s\), in fact, as the elimination ideals show, they are rational expressions of \(\alpha \) and \(s\). Thus we have obtained a parametrization of the monic sextic Zolotarev polynomials by \(s\). However, to condense the description, we note that \(\beta \) can be equivalently described as the second root of the degree-eight polynomial \(G_{8,s}(\beta )\), see (<a href="#G8a">3.5</a>), and we are able to give the solution in a recursive way, because already in some of the 15 input polynomials \(q_{6j}\)’s in \(Q6\), the coefficients of \(P_{6,s}\) and its norm \(L\) occur linearly. For instance, we have </p>
<div class="displaymath" id="ea4">
  \begin{align}  q_{613}=& 36 + 24 a_4 + 396 s^2 - 360 s \alpha - 360 s \beta \label{ea4}\\ & -36 \alpha \beta + 432 s (-2 s + \alpha + \beta ) + 9 (-2 s + \alpha + \beta )^2, \nonumber \end{align}
</div>
<p> and solving \(q_{613}=0\) for the variable \(a_4\) gives \(a_4=a^{*}_{4,6}(s)\) as in Theorem <a href="#thm41">4.1</a> below. Hence, \(a_4\) is uniquely determined once \(\alpha \) and \(\beta \) are known (for fixed&#160;\(s\)). </p>
<p><div class="theorem_thmwrapper " id="thm41">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">4.1</span>
  </div>
  <div class="theorem_thmcontent">
  <p> An algebraic solution to <i class="it">ZFP</i> for \(n=6\) and for an assigned fixed \(s{\gt} \tan ^2\left(\pi /12\right)\), but \(s\neq 1/3\), can be deduced recursively as follows, see <span class="rm">(<a href="#d6Zol01">4.1</a>)</span>, <span class="rm">(<a href="#d6Zol02">4.2</a>)</span>: </p>
<div class="displaymath" id="a0000000013">
  \begin{align}  \alpha =& \,  \alpha ^{*}(s)={\rm Root[}F_{8,s},2{\rm ]},\\ \beta =&  \beta ^{*}(s)={\rm Root[}G_{8,s},2{\rm ]}, \nonumber \\ a_4=& \,  a^{*}_{4,6}(s)=\tfrac {3}{8}(-4 + 48 s^2 - 4 s \alpha - \alpha ^2 - 4 s \beta + 2 \alpha \beta - \beta ^2), \nonumber \\ a_3=& \,  a^{*}_{3,6}(s)=\tfrac {1}{3}(30 s + 4 a_4 s - 180 s^3 + 3 \alpha + 2 a_4 \alpha - 3 s^2 \alpha \nonumber \\ & + 9 s \alpha ^2 + 3 \beta + 2 a_4 \beta - 3 s^2 \beta - 12 s \alpha \beta + 9 s \beta ^2), \nonumber \\ a_2=& \,  a^{*}_{2,6}(s)\! =\! \tfrac {1}{24}(\! -\! 24 a_4 \! -\! \!  10 a_4^2 \! +\!  54 a_3 s \! -\!  450 s^2 \! +\!  396 a_4 s^2 \! -\!  648 s^4 \! + 18 a_3 \alpha \! \!  \nonumber \\ &  -180 s \alpha - 60 a4 s \alpha + 648 s^3 \alpha - 9 a_4 \alpha ^2 - 162 s^2 \alpha ^2 + 18 a_3 \beta - 180 s \beta \nonumber \\ &  -60 a_4 s \beta + 648 s^3 \beta - 18 \alpha \beta + 6 a_4 \alpha \beta + 126 s^2 \alpha \beta - 9 a_4 \beta ^2 - 162 s^2 \beta ^2), \nonumber \\ L=& \,  L^{*}(s)=\tfrac {1}{1-\alpha } (1 + a_2 + a_4 + a_3 \alpha - 6 s \alpha - a_2 \alpha ^2 - a_3 \alpha ^3 - a_4 \alpha ^4 + 6 s \alpha ^5 - \alpha ^6), \nonumber \\ a_1=& \,  a^{*}_{1,6}(s)=-a_3-L+6s, \nonumber \\ a_0=& \,  a^*_{0,6}(s)=-1-a_2-a_4. \nonumber \end{align}
</div>
<p> For the special choice \(s=1/3\), \(\alpha ^{*}\) and \(\beta ^{*}\) needs to be computed as given in <span class="rm">(<a href="#s13alphabeta">4.18</a>)</span>, <span class="rm">(<a href="#f66">4.19</a>)</span> and <span class="rm">(<a href="#g66">4.20</a>)</span>. <span class="qed">â–¡</span></p>

  </div>
</div> <div class="example_thmwrapper " id="exampled6s1r">
  <div class="example_thmheading">
    <span class="example_thmcaption">
    Example
    </span>
    <span class="example_thmlabel">4.2</span>
  </div>
  <div class="example_thmcontent">
  <p> The goal is to determine \(Z^{*}_{6,s=1}\), the sextic proper monic Zolotarev polynomial with parameter \(s=s_0=1{\gt}\tan ^2(\pi /12)\) and \(L^*\), its least deviation from the zero-function on \(\boldsymbol {I}\). We get with \(s=1\) </p>
<div class="displaymath" id="a0000000014">
  \begin{align}  F_{8,s}(\alpha )=& -8496203 + 4142488 \alpha + 4186828 \alpha ^2 - 4660184 \alpha ^3 \\ & +2434558 \alpha ^4 - 1006808 \alpha ^5 + 299468 \alpha ^6 - 49000 \alpha ^7 + 3125 \alpha ^8 \nonumber \end{align}
</div>
<p> and </p>
<div class="displaymath" id="a0000000015">
  \begin{align}  G_{8,s}(\beta )=& 2439189 - 306168 \beta - 2809172 \beta ^2 + 1190904 \beta ^3 \\ & +968478 \beta ^4 - 958024 \beta ^5 + 322668 \beta ^6 - 51000 \beta ^7 + 3125 \beta ^8. \nonumber \end{align}
</div>
<p> Picking the appropriate (largest) positive root \({\gt}1\) of these polynomials gives </p>
<div class="equation" id="a0000000016">
<p>
  <div class="equation_content">
    \begin{equation}  \alpha =\alpha ^*={\rm Root[}F_{8,s},2{\rm ]}=6.082716\dots \quad {\rm respectively} \end{equation}
  </div>
  <span class="equation_label">4.10</span>
</p>
</div>
<div class="equation" id="a0000000017">
<p>
  <div class="equation_content">
    \begin{equation}  \beta =\beta ^*={\rm Root[}G_{8,s},2{\rm ]}=6.0828088\dots \, . \end{equation}
  </div>
  <span class="equation_label">4.11</span>
</p>
</div>
<p> Inserting these real numbers into the expression for \(a_{4}\) in Theorem <a href="#thm41">4.1</a> gives </p>
<div class="displaymath" id="a0000000018">
  \begin{align} & a^{*}_{4,6}(s=1)=\\ & ={\rm Root[}-24974796693375 + 518755962600 x + 4763147078844 x^2 \nonumber \\ &  -1611134445672 x^3 + 249132993894 x^4 - 21634573608 x^5 \nonumber \\ &  + 1098618876 x^6 - 31095000 x^7 + 390625 x^8, 1{\rm ]}=-1.74828\dots \, . \nonumber \end{align}
</div>
<p> Similarly, after computing the other coefficients and the norm, we get </p>
<div class="displaymath" id="a0000000019">
  \begin{align}  Z^{*}_{6,s=1}(x)\! =\! (-0.06207\dots )\! +\! (-1.86731\dots )x\! +\! 0.81036\dots x^2+\\ 7.48972\dots x^3+(-1.74828\dots )x^4+(-6)x^5+x^6 \nonumber \end{align}
</div>
<p> and </p>
<div class="equation" id="a0000000020">
<p>
  <div class="equation_content">
    \begin{equation}  L^{*}=0.377586\dots \, . \end{equation}
  </div>
  <span class="equation_label">4.14</span>
</p>
</div>

  </div>
</div> </p>
<h2 id="a0000000021">4.2 Second solution path: Modification of Malyshev’s and Schiefermayr’s approach</h2>
<p> Our second solution path to <i class="it">ZFP</i> was inspired by the papers <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span> and <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span>. We merge and modify their approaches to <i class="it">ZFP</i>. <div class="theorem_thmwrapper " id="thm42">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">4.3</span>
  </div>
  <div class="theorem_thmcontent">
  <p> An algebraic solution to <i class="it">ZFP</i> for \(n = 6\) can be deduced in three algorithmic steps as follows: </p>
<p>(i) Express the sought-for sextic proper Zolotarev polynomial and its norm \(L\) in a tentative form which depends on the (undetermined) parameters \(\alpha \) and \(\beta \), that is </p>
<div class="displaymath" id="Z6b">
  \begin{align} & \! \! \!  Z_{6,\alpha ,\beta }(x)= \label{Z6b} \\ =& (-(-1 \! +\!  \beta ) (-\alpha \! +\!  \beta ) (256 \! -\!  3 \alpha ^8 + 8 \alpha ^7 \beta \! -\!  512 \beta ^2 + 160 \beta ^4 + 64 \beta ^6 3 \beta ^8 \nonumber \\ & -24 \alpha ^5 \beta (-8 + 3 \beta ^2) + 4 \alpha ^6 (16 + 3 \beta ^2) + 8 \alpha \beta ^3 (-48 + 24 \beta ^2 + \beta ^4) \nonumber \\ &  - 8 \alpha ^3 \beta (48 - 16 \beta ^2 + 9 \beta ^4) + 10 \alpha ^4 (16 - 32 \beta ^2 + 11 \beta ^4) \nonumber \\ &  + 4 \alpha ^2 (-128 + 112 \beta ^2 - 80 \beta ^4 + 3 \beta ^6))^2 + 2 (-1 + x) (x - \alpha )\cdot \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000022">
  \begin{align} &  \cdot (-256 + 3 \alpha ^8 + 8 \alpha ^7 \beta - 512 \beta ^2 + 864 \beta ^4 - 128 \beta ^6 + 35 \beta ^8 \nonumber \\ &  -24 \alpha ^5 \beta (-8 + 11 \beta ^2) + \alpha ^6 (-64 + 52 \beta ^2) - 24 \alpha ^3 \beta (16 - 16 \beta ^2 + 3 \beta ^4) \nonumber \\ &  -8 \alpha \beta ^3 (48 - 56 \beta ^2 + 7 \beta ^4) + 2 \alpha ^4 (-80 - 128 \beta ^2 + 153 \beta ^4) \nonumber \\ &  +\alpha ^2 (512 + 64 \beta ^2 - 576 \beta ^4 - 12 \beta ^6) + 16 x^2 (64 + \alpha ^6 + 6 \alpha ^5 \beta - 16 \beta ^2 \nonumber \\ &  - 52 \beta ^4 + 5 \beta ^6 + \alpha ^4 (44 - 29 \beta ^2) + 4 \alpha ^3 \beta (-4 + 9 \beta ^2) \nonumber \\ & +\alpha ^2 (-80 + 104 \beta ^2 - 9 \beta ^4) - 2 \alpha \beta (-48 + 40 \beta ^2 + 5 \beta ^4)) - 16 x (\alpha + \beta )^2 \nonumber \\ &  (\alpha ^5 + 3 \alpha ^4 \beta + \alpha ^3 (24 - 22 \beta ^2) - 3 \alpha (4 - 3 \beta ^2)^2 + \alpha ^2 (-40 \beta + 38 \beta ^3) \nonumber \\ &  + \beta (48 - 56 \beta ^2 + 7 \beta ^4)))^2)/ \nonumber \\ & (512 (64 + \alpha ^6 + 6 \alpha ^5 \beta - 16 \beta ^2 - 52 \beta ^4 + 5 \beta ^6 + \alpha ^4 (44 - 29 \beta ^2) + 4 \alpha ^3 \beta \nonumber \\ & (-4 + 9 \beta ^2) + \alpha ^2 (-80 + 104 \beta ^2 \! -\!  9 \beta ^4) \! -\!  2 \alpha \beta (-48 + 40 \beta ^2 + 5 \beta ^4))^2), \nonumber \end{align}
</div>
<p> and </p>
<div class="equation" id="L6b">
<p>
  <div class="equation_content">
    \begin{equation} \label{L6b} L=L(\alpha ,\beta )=|Z_{6,\alpha ,\beta }(1)|. \end{equation}
  </div>
  <span class="equation_label">4.16</span>
</p>
</div>
<p> <div class="remark_thmwrapper " id="a0000000023">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">4.4</span>
  </div>
  <div class="remark_thmcontent">
  <p>We refrain here from representing \(Z_{6,\alpha ,\beta }\) in the power form since the expansion \(Z_{6,\alpha ,\beta }(x)=\sum _{k=0}^6 a_{k,6}(\alpha ,\beta ) x^k\) with \(a_{5,6}(\alpha ,\beta )=-6s\) and \(a_{6,6}(\alpha ,\beta )=1\) produces bulky coefficients \(a_{k,6}(\alpha ,\beta )\) for \(k=0,\dots , 4\). But we provide them, for the reader’s convenience, in our web-based repository <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span>. </p>

  </div>
</div> (ii) For an assigned fixed \(s{\gt}\tan ^2\left(\pi /12\right)\), but \(s\neq 1/3\), determine the corresponding optimal \(\alpha =\alpha (s)=\alpha ^*\) and \(\beta =\beta (s)=\beta ^*\) as a positive root \({\gt}1\) of \(F_{8,s}\) respectively of \(G_{8,s}\) (see <span class="rm">(<a href="#F8a">3.4</a>)</span> and <span class="rm">(<a href="#G8a">3.5</a>)</span>), more precisely, </p>
<div class="equation" id="alphabeta1">
<p>
  <div class="equation_content">
    \begin{equation} \label{alphabeta1} \alpha ^{*}={\rm Root[}F_{8,s},2{\rm ]} \quad {\rm respectively} \quad \beta ^{*}={\rm Root[}G_{8,s},2{\rm ]}. \end{equation}
  </div>
  <span class="equation_label">4.17</span>
</p>
</div>
<p> For the special choice \(s=1/3\), determine the corresponding optimal \(\alpha ^*\) and \(\beta ^{*}\) as </p>
<div class="equation" id="s13alphabeta">
<p>
  <div class="equation_content">
    \begin{equation} \label{s13alphabeta} \alpha ^{*}={\rm Root[}f_6,2{\rm ]}=2.233289\dots \quad {\rm respectively} \quad \beta ^{*}={\rm Root[}g_6,2 {\rm ]}=2.238828\dots \, , \end{equation}
  </div>
  <span class="equation_label">4.18</span>
</p>
</div>
<p> where </p>
<div class="displaymath" id="f66">
  \begin{align}  f_6(\alpha )=-257923 - 33678 \alpha + 156979 \alpha ^2 \label{f66}\\ +52988 \alpha ^3 + 7187 \alpha ^4 - 84750 \alpha ^5 + 28125 \alpha ^6, \nonumber \end{align}
</div>
<div class="displaymath" id="g66">
  \begin{align}  g_6(\beta )=46493 - 397778 \beta + 944755 \beta ^2 \label{g66}\\ -1098684 \beta ^3 + 676787 \beta ^4 - 215250 \beta ^5 + 28125 \beta ^6. \nonumber \end{align}
</div>
<p> (iii) Then replace in the expression <span class="rm">(<a href="#Z6b">4.15</a>)</span> above, the parameter \(\alpha \) by the real number \(\alpha ^*{\gt}1\) and the parameter \(\beta \) by the real number \(\beta ^{*}{\gt}1\) (with \(1{\lt}\alpha ^*{\lt}\beta ^*\)) and rearrange terms in order to obtain a power form representation of the sextic polynomial in the variable \(x\). Its coefficients \(a_{k,6}(\alpha ^{*},\beta ^{*})\) agree with the optimal coefficients \(a^{*}_{k,6}(s)\), for \(k=0,\dots ,4\), of the sought-for monic proper Zolotarev polynomial \(Z^{*}_{6,s}\). Finally, evaluate \(Z^{*}_{6,s}(x)\) at \(x=1\) in order to get, up to sign, the real number \(L(\alpha ^*,\beta ^*)=L^*\) in <span class="rm">(<a href="#L6b">4.16</a>)</span>, the least deviation of \(Z^{*}_{6,s}\) on \(\boldsymbol {I}\) from the zero-function. <span class="qed">â–¡</span></p>

  </div>
</div> <div class="remark_thmwrapper " id="a0000000024">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">4.5</span>
  </div>
  <div class="remark_thmcontent">
  <p>The just described step allows to generate numerical values of arbitrary precision for the optimal coefficients \(a^{*}_{k,6}(s)\) of \(Z^{*}_{6,s}\) and can be accomplished, for \(s\neq 1/3\), by executing the following simple <em>Mathematica</em> call (where \(Z6\alpha \beta =Z_{6,\alpha ,\beta }\), \(F8s=F_{8,s}\), \(G8s=G_{8,s}\) and \(s_0\) is an assigned fixed value for \(s\), and \(p\) is an assigned fixed integer value for the \(p\)-digit precision of the numerical result): </p>
<div class="equation" id="M6call">
<p>
  <div class="equation_content">
    \begin{equation} \label{M6call} {\bf N[}Z6\alpha \beta /.\alpha \! \! \rightarrow \!  {\bf Root[}F8s/.s\rightarrow \!  s_0,2{\bf ]} /.\beta \! \! \rightarrow \!  {\bf Root[}G8s/.s\rightarrow \!  s_0,2],p{\bf ]//Expand} \end{equation}
  </div>
  <span class="equation_label">4.21</span>
</p>
</div>
<p> If we assume that \(s{\gt}\tan ^2(\pi /12)\) is an integer or a rational number \(a/b\), then we can explicitly express each \(a^{*}_{k,6}(s)\) as a root object \({\rm Root[}P_8,k{\rm ]}\) (where \(P_8\) is a dedicated integer polynomial of degree eight), for example by executing the <em>Mathematica</em> call <b class="bf">RootReduce</b>. </p>

  </div>
</div> <div class="example_thmwrapper " id="exampled6s18">
  <div class="example_thmheading">
    <span class="example_thmcaption">
    Example
    </span>
    <span class="example_thmlabel">4.6</span>
  </div>
  <div class="example_thmcontent">
  <p> The goal is to determine \(Z^{*}_{6,s=1/8}\), the sextic proper monic Zolotarev polynomial with parameter \(s=s_0=1/8=0.125{\gt}\tan ^2(\pi /12)\) and \(L^*\), its least deviation from the zero-function on \(\boldsymbol {I}\). We get with \(s=1/8\) </p>
<div class="displaymath" id="a0000000025">
  \begin{align}  F_{8,s}(\alpha )=& -\tfrac {38851047}{65536} + \tfrac {1577289 \alpha }{512} - \tfrac { 1036789 \alpha ^2}{512} - \tfrac {1061481 \alpha ^3}{128} \\ & +\tfrac { 600285 \alpha ^4}{128} + \tfrac {41539 \alpha ^5}{4} - 5382 \alpha ^6 - 5250 \alpha ^7 + 3125 \alpha ^8 \nonumber \end{align}
</div>
<p> and </p>
<div class="displaymath" id="a0000000026">
  \begin{align}  G_{8,s}(\beta )=& -\tfrac {51554663}{65536} + \tfrac {250969 \beta }{512} + \tfrac {2498291 \beta ^2}{512} - \tfrac { 1188689 \beta ^3}{128} \\ & -\tfrac {624547 \beta ^4}{128} + \tfrac {62795 \beta ^5}{4} - 2482 \beta ^6 - 7250 \beta ^7 + 3125 \beta ^8. \nonumber \end{align}
</div>
<p> Solving for the appropriate positive root \({\gt}1\) of these polynomials gives </p>
<div class="equation" id="a0000000027">
<p>
  <div class="equation_content">
    \begin{equation}  \alpha =\alpha ^*={\rm Root[}F_{8,s},2{\rm ]}=1.2107637\dots \quad {\rm respectively} \end{equation}
  </div>
  <span class="equation_label">4.24</span>
</p>
</div>
<div class="equation" id="a0000000028">
<p>
  <div class="equation_content">
    \begin{equation}  \beta =\beta ^*={\rm Root[}G_{8,s},2{\rm ]}=1.2826256\dots \, . \end{equation}
  </div>
  <span class="equation_label">4.25</span>
</p>
</div>
<p> Inserting these real numbers into the expression <span class="rm">(<a href="#Z6b">4.15</a>)</span> and rearranging yields </p>
<div class="displaymath" id="a0000000029">
  \begin{align}  Z^{*}_{6,s=1/8}(x)\! =\! (-0.0500034\dots )\! +\! (-0.2023092\dots )x\! +\! 0.7382004\dots x^2\\ +0.8898304\dots x^3+(-1.6881970\dots )x^4+\left(-\tfrac {3}{4}\right)x^5+x^6, \nonumber \end{align}
</div>
<p> and evaluating \(|Z^{*}_{6,s=1/8}(1)|\) yields </p>
<div class="equation" id="a0000000030">
<p>
  <div class="equation_content">
    \begin{equation}  L^{*}=0.0624788\dots \, . \end{equation}
  </div>
  <span class="equation_label">4.27</span>
</p>
</div>
<p> A corresponding call in <em>Mathematica</em> would read here </p>
<div class="equation" id="M6callspec">
<p>
  <div class="equation_content">
    \begin{equation} \label{M6callspec} {\bf N[}Z6\alpha \beta /.\alpha \! \! \rightarrow \!  {\bf Root[}F8s/.s\rightarrow \!  \tfrac {1}{8},2{\bf ]} /.\beta \! \! \rightarrow \!  {\bf Root[}G8s/.s\rightarrow \!  \tfrac {1}{8},2],8{\bf ]//Expand} \end{equation}
  </div>
  <span class="equation_label">4.28</span>
</p>
</div>
<p> Upon using the <b class="bf">RootReduce</b> call we would get here the following explicit algebraic expression for \(a^{*}_{4,6}\) by means of a root object (and similar expressions for the other coefficients): </p>
<div class="displaymath" id="coeffa46s18">
  \begin{align} & a^{*}_{4,6}(s=1/8)= \label{coeffa46s18}\\ & {\rm Root[}14776676496736461 + 65194824742046316 x + 124565949527455296 x^2 \nonumber \\ &  +134777006368948224 x^3 + 90433468346204160 x^4 + 38602113736900608 x^5 \nonumber \\ &  +10265567828115456 x^6 + 1562042695680000 x^7 + 104857600000000 x^8 , 1{\rm ]}. \nonumber \end{align}
</div>
<p> A corresponding call in <em>Mathematica</em> would read (where <b class="bf">Collect</b> means to collect together terms with the same power of \(x\)): </p>
<div class="equation" id="a0000000031">
<p>
  <div class="equation_content">
    \begin{equation}  {\bf Collect[}Z6\alpha \beta /.\alpha \! \! \rightarrow \!  {\bf Root[}F8s,2{\bf ]}/.\beta \! \% \rightarrow \!  {\bf Root[}G8s,2{\bf ]} /.s\! \! \rightarrow \! \tfrac {1}{8}{,x\bf ]}//{\bf RootReduce} \end{equation}
  </div>
  <span class="equation_label">4.30</span>
</p>
</div>
<p> In Fig. <a href="#figure 2">2</a> the graph of \(Z^{*}_{6,s=1/8}\) is displayed, with vertical lines to the right of \(x=1\) indicating \(\alpha ^{*}\) and \(\beta ^{*}\).<span class="qed">â–¡</span></p>
<figure id="figure 2">
  <div class="centered"> <img src="img-0002.png" alt="\includegraphics[width=3.0in]{GraphForZol2.png}" style="width:3.0in" />
 </div>
<figcaption>
  <span class="caption_title">Figure</span> 
  <span class="caption_ref">2</span> 
  <span class="caption_text">\(Z^{*}_{6,\frac{1}{8}}\).</span> 
</figcaption>


</figure>

  </div>
</div> </p>
<h1 id="a0000000032">5 Explicit algebraic solution to <i class="it">ZFP</i> for polynomials  of degree \(n = 7\)</h1>
<h2 id="a0000000033">5.1 First solution path: Abel-Pell differential equation and Groebner basis</h2>
<p>Let \(s{\gt}\tan ^2\left(\pi /14\right)=0.05209\dots \) be arbitrary but fixed. We search for the septic solution of <i class="it">ZFP</i> in the form analogous to (<a href="#d6Zol02">4.2</a>) given in Section <a href="#subsection61">4.1</a>. Let </p>
<div class="equation" id="d7Zol01">
<p>
  <div class="equation_content">
    \begin{equation} \label{d7Zol01} P_{7a,s}(x)=a_0+a_1 x+a_2 x^2+a_3 x^3+a_4 x^4+a_5x^5+(-7s)x^6+x^7, \end{equation}
  </div>
  <span class="equation_label">5.1</span>
</p>
</div>
<p> and let \(L\) be the uniform norm of \(P_{7a,s}\) on \(\boldsymbol {I}\). By using the fact that for the solution to <i class="it">ZFP</i> we have \(P_{7a,s}(1)=-L, P_{7a,s}(-1)=-L\), we may consider </p>
<div class="displaymath" id="d7Zol02">
  \begin{align}  P_{7,s}(x)=& (\! -\! a_2\! -\! a_4\! -\! L+7s)+(-1\! -\! a_3\! -\! a_5) x \label{d7Zol02}\\ & +a_2 x^2+a_3 x^3+a_4 x^4+a_5 x^5+(-7s)x^6+x^7. \nonumber \end{align}
</div>
<p> If \(\beta {\gt}\alpha {\gt}1\) denotes the uniquely existing points where \(P_{7,s}(\alpha )=-L\) and \(P_{7,s}(\beta )=L\), then it is known that the sought-for polynomial satisfies the differential equation (<a href="#DEna">3.3</a>), here for \(n=7\): </p>
<div class="equation" id="DE7a">
<p>
  <div class="equation_content">
    \begin{equation} \label{DE7a} (1-x^2)\tfrac {(x-\alpha )(x-\beta )}{49 (x-(1/2)(\alpha +\beta -2s))^2} (P_{7,s}'(x))^2=L^2-(P_{7,s}(x))^2. \end{equation}
  </div>
  <span class="equation_label">5.3</span>
</p>
</div>
<p> By clearing denominators and by a coefficient-comparison we get polynomial equations in \(s,\alpha ,\beta ,L,a_2,a_3,a_4,a_5\). To be able to distinguish between \(\alpha \) and \(\beta \) we add the constraints \(P_{7,s}(\alpha )=-L, P_{7,s}(\beta )=L\) to the system. By reducing the equations to zero, we are left with a system \(Q7=\{ q_{701},\dots ,q_{717}\} \) consisting of 17 polynomials. We compute a lexicographic Groebner basis (with <em>Mathematica</em>) for \(Q7\). As a result, we obtain that for each particular \(s\) the ideal generated by \(Q7\) is a zero-dimensional ideal and if we choose that variable order where \(s\) and \(\alpha \) are the smallest in the ordering, we get the irreducible polynomial \(F_{12,s}(\alpha )\) given in (<a href="#F12a">3.6</a>) as the first element of the basis. </p>
<p>Again, analogously to the sextic case, for a fixed \(s\), the univariate polynomial \(F_{12}(\alpha )\) has several real roots, but we have to take the largest real root for the construction of the extremal polynomial, that is, the fourth root, if \(s{\lt}3/7\), and the sixth root otherwise. </p>
<p>Not only \(\alpha \), but also all the coefficients, the norm \(L\) and the other outer equiscillation point \(\beta \) are uniquely determined by \(s\), in fact, as the elimination ideals show, they are rational expressions of \(\alpha \) and \(s\). Thus we have obtained a parametrization of the monic septic Zolotarev polynomials by \(s\). However, to condense the description, we note that \(\beta \) can be equivalently described as a uniquely determined root of the degree-twelve polynomial \(G_{12,s}(\beta )\), see (<a href="#G12a">3.7</a>). For the precise characterization of the root index we need an auxiliary polynomial \(H_{22}\) given in (<a href="#H22">3.8</a>), which is a factor of a discriminant of \(G_{12,s}\). Now we are able to give the solution in a recursive way as follows: <div class="theorem_thmwrapper " id="thm51">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">5.1</span>
  </div>
  <div class="theorem_thmcontent">
  <p> An algebraic solution to <i class="it">ZFP</i> for \(n=7\) and for an assigned fixed \(s{\gt}\tan ^2\left(\pi /14\right)\), but \(s\ne 1/7\), can be deduced recursively as follows, see <span class="rm">(<a href="#d7Zol01">5.1</a>)</span>, <span class="rm">(<a href="#d7Zol02">5.2</a>)</span>: </p>
<div class="displaymath" id="a0000000034">
  \begin{align}  \alpha & = \alpha ^{*}(s)= \begin{cases}  {\rm Root[}F_{12,s},4{\rm ]}& {\text if\,  } s{\lt}3/7\\ {\rm Root[}F_{12,s},6{\rm ]}& {\text if\,  } s\ge 3/7, \end{cases} \nonumber \\ \beta & = \beta ^{*}(s)= \begin{cases}  {\rm Root[}G_{12,s},3{\rm ]}& {\text if\,  } s\le {\rm Root[}H_{22},4{\rm ]}=0.12277\dots \\ {\rm Root[}G_{12,s},4{\rm ]}& {\text if\,  } {\rm Root[}H_{22},4{\rm ]}{\lt}s{\lt}3/7\\ {\rm Root[}G_{12,s},6{\rm ]}& {\text if\,  } s\ge 3/7, \end{cases} \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000035">
  \begin{align}  a_5& = a^{*}_{5,7}(s)=\tfrac {7}{16} (-4 + 56 s^2 - 4 s \alpha - \alpha ^2 - 4 s \beta + 2 \alpha \beta - \beta ^2), \nonumber \\ a_4& = a^{*}_{4,7}(s)=\tfrac {1}{12} (168 s + 20 a_5 s - 1176 s^3 + 14 \alpha + 8 a_5 \alpha - 14 s^2 \alpha \nonumber \\ & \quad +49 s \alpha ^2 + 14 \beta + 8 a_5 \beta - 14 s^2 \beta - 70 s \alpha \beta + 49 s \beta ^2), \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000036">
  \begin{align}  a_3= & a^{*}_{3,7}(s)=\tfrac {1}{224} (-280 a_5 - 96 a_5^2 + 616 a_4 s - 7056 s^2 + 5096 a_5 s^2 \\ &  -9604 s^4 + 168 a_4 \alpha - 2352 s \alpha - 672 a_5 s \alpha + 9604 s^3 \alpha - 98 a_5 \alpha ^2 \nonumber \\ &  -2401 s^2 \alpha ^2 + 168 a_4 \beta - 2352 s \beta - 672 a_5 s \beta + 9604 s^3 \beta - 196 \alpha \beta \nonumber \\ &  +84 a_5 \alpha \beta + 2254 s^2 \alpha \beta - 98 a_5 \beta ^2 - 2401 s^2 \beta ^2), \nonumber \\ a_2=& a^{*}_{2,7}(s)=-a_4 + 7 s - \alpha - a_3 \alpha - a_5 \alpha - a_4 \alpha ^2 \nonumber \\ &  +7 s \alpha ^2 - \alpha ^3 - a_5 \alpha ^3 + 7 s \alpha ^4 - \alpha ^5, \nonumber \\ L=& L^{*}(s)=\tfrac {1}{2} (-a_2 - a_4 + 7 s - \beta - a_3 \beta - a_5 \beta + a_2 \beta ^2 \nonumber \\ &  +a_3 \beta ^3 + a_4 \beta ^4 + a_5 \beta ^5 - 7 s \beta ^6 + \beta ^7), \nonumber \\ a_1=&  a^{*}_{1,7}(s)=-1 - a_3 - a_5, \nonumber \\ a_0=& a^{*}_{0,7}(s)=-a_2 - a_4 - L + 7 s. \nonumber \end{align}
</div>
<p> For the special choice \(s=1/7\), \(\alpha ^{*}\) and \(\beta ^{*}\) needs to be computed as given in <span class="rm">(<a href="#s17alphabeta">5.16</a>)</span>, <span class="rm">(<a href="#f79">5.17</a>)</span> and <span class="rm">(<a href="#g79">5.18</a>)</span>. <span class="qed">â–¡</span></p>

  </div>
</div> </p>
<h2 id="a0000000037">5.2 Second solution path: Modification of Malyshev’s and Schiefermayr’s approach</h2>
<p> <div class="theorem_thmwrapper " id="thm52">
  <div class="theorem_thmheading">
    <span class="theorem_thmcaption">
    Theorem
    </span>
    <span class="theorem_thmlabel">5.2</span>
  </div>
  <div class="theorem_thmcontent">
  <p> An algebraic solution to <i class="it">ZFP</i> for \(n = 7\) can be deduced in three algorithmic steps as follows: </p>
<p>(i) Express the sought-for septic proper Zolotarev polynomial and its norm \(L\) in a tentative form which depends on the (undetermined) parameters \(\alpha \) and \(\beta \), that is </p>
<div class="displaymath" id="Z7b">
  \begin{align} & Z_{7,\alpha ,\beta }(x) \label{Z7b}=\\ &  =((-4 + (\alpha - \beta ) (3 \alpha + \beta ))^2 ((\alpha - \beta ) (-1 + \beta ^2) \nonumber \\ &  (-1024 + 1280 \alpha ^2 + 384 \alpha ^4 - 736 \alpha ^6 + 44 \alpha ^8 - 7 \alpha ^{10} + 6 \alpha (-256 + 256 \alpha ^2 \nonumber \\ & + 32 \alpha ^4 - 112 \alpha ^6 + 7 \alpha ^8) \beta + 3 (768 - 2304 \alpha ^2 + 1056 \alpha ^4 + 48 \alpha ^6 - 29 \alpha ^8) \beta ^2 \nonumber \\ &  +8 \alpha (-64 - 496 \alpha ^2 + 260 \alpha ^4 + 3 \alpha ^6) \beta ^3 + 42 (-64 + 48 \alpha ^2 - 44 \alpha ^4 + 5 \alpha ^6) \beta ^4 \nonumber \\ &  -84 \alpha (16 - 8 \alpha ^2 + 5 \alpha ^4) \beta ^5 + 42 (4 - 3 \alpha ^2)^2 \beta ^6 + 24 \alpha (20 - 7 \alpha ^2) \beta ^7 + 3 (36 + 7 \alpha ^2) \nonumber \\ &  \cdot \beta ^8 + 10 \alpha \beta ^9 - 3 \beta ^{10})^2 - 2 (-1 + x^2) (-x + \alpha ) (-1024 - 7 \alpha ^{10} + 14 \alpha ^9 \beta \nonumber \\ &  +1280 \beta ^2 + 384 \beta ^4 - 736 \beta ^6 + 44 \beta ^8 - 7 \beta ^{10} + 8 \alpha ^7 \beta (-28 + 5 \beta ^2) + \alpha ^8 (44 + 5 \beta ^2) \nonumber \\ &  +\alpha ^6 (-736 + 464 \beta ^2 - 254 \beta ^4) + \alpha ^5 (64 \beta - 544 \beta ^3 + 404 \beta ^5) + \alpha ^4 (384 + 224 \beta ^2 + \nonumber \\ &  +520 \beta ^4 - 254 \beta ^6) + 8 \alpha ^3 \beta (64 + 112 \beta ^2 - 68 \beta ^4 + 5 \beta ^6) + \alpha ^2 (1280 - 1792 \beta ^2 \nonumber \\ &  + 224 \beta ^4 + 464 \beta ^6 + 5 \beta ^8) + 2 \alpha \beta (-256 + 256 \beta ^2 + 32 \beta ^4 - 112 \beta ^6 + 7 \beta ^8) \nonumber \\ &  - 8 x^2 (-4 + \alpha ^2 + (-4 + \beta ) \beta - 2 \alpha (2 + \beta )) (-4 + \alpha ^2 - 2 \alpha (-2 + \beta ) + \beta (4 + \beta ))\cdot \nonumber \end{align}
</div>
<div class="displaymath" id="a0000000038">
  \begin{align} &  \cdot (-4 + (\alpha - \beta ) (3 \alpha + \beta )) (4 + (\alpha - \beta ) (\alpha + 3 \beta )) + 4 x (\alpha + \beta ) (-256 + (\alpha - \beta )^2 \nonumber \\ &  (256 + 32 \alpha ^2 + 7 (-4 + \alpha ) \alpha ^4 (4 + \alpha ) + 448 \alpha \beta - 10 \alpha ^3 (32 + \alpha ^2) \beta + (32 - 160 \alpha ^2 \nonumber \\ &  -23 \alpha ^4) \beta ^2 + 4 \alpha (-80 + 13 \alpha ^2) \beta ^3 - (112 + 23 \alpha ^2) \beta ^4 - 10 \alpha \beta ^5 + 7 \beta ^6)))^2))/ \nonumber \\ &  (128 (4 - 3 \alpha ^2 + 2 \alpha \beta + \beta ^2)^4 (-4 + \alpha ^2 + (-4 +  \beta ) \beta - 2 \alpha (2 + \beta ))^2 \nonumber \\ &  (-4 + \alpha ^2 - 2 \alpha (-2 + \beta ) + \beta (4 + \beta ))^2 (4 + ( \alpha - \beta ) (\alpha + 3 \beta ))^2), \nonumber \end{align}
</div>
<p> and </p>
<div class="equation" id="L7b">
<p>
  <div class="equation_content">
    \begin{equation} \label{L7b} L=L(\alpha ,\beta )=|Z_{7,\alpha ,\beta }(1)|. \end{equation}
  </div>
  <span class="equation_label">5.11</span>
</p>
</div>
<p> <div class="remark_thmwrapper " id="a0000000039">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">5.3</span>
  </div>
  <div class="remark_thmcontent">
  <p>We refrain here from representing \(Z_{7,\alpha ,\beta }\) in the power form since the expansion \(Z_{7,\alpha ,\beta }(x)=\sum _{k=0}^7 a_{k,7}(\alpha ,\beta ) x^k\) with \(a_{6,7}(\alpha ,\beta )=-7s\) and \(a_{7,7}(\alpha ,\beta )=1\) produces bulky coefficients \(a_{k,7}(\alpha ,\beta )\) for \(k=0,\dots , 5\). But we provide them, for the reader’s convenience, in our web-based repository <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span>. </p>

  </div>
</div> (ii) For an assigned fixed \(s{\gt}\tan ^2\left(\pi /14\right)\), but \(s\neq 1/7\), determine the corresponding optimal \(\beta =\beta (s)=\beta ^*\) as a positive root \({\gt}1\) of \(G_{12,s}\) (see <span class="rm">(<a href="#G12a">3.7</a>)</span>), more precisely (utilizing the polynomial \(H_{22}\) as given in <span class="rm">(<a href="#H22">3.8</a>)</span>): </p>
<div class="displaymath" id="beta1a">
  \begin{align} \label{beta1a} \beta ^{*}& ={\rm Root[}G_{12,s},3{\rm ]}, {\rm \,  if\, } \tan ^2\left(\tfrac {\pi }{14}\right){\lt}s\le {\rm Root[}H_{22},4{\rm ]},\\ \beta ^{*}& ={\rm Root[}G_{12,s},4{\rm ]}, {\rm \,  if\, } {\rm Root[}H_{22},4{\rm ]}{\lt}s{\lt}\tfrac {3}{7}, {\rm \, but\, } s\neq \tfrac {1}{7},\\ \beta ^{*}& ={\rm Root[}G_{12,s},6{\rm ]}, {\rm \,  if\, } \tfrac {3}{7}\le s. \end{align}
</div>
<p> Deploying the polynomial as given in <span class="rm">(<a href="#K9">3.9</a>)</span> and inserting there the number \(\beta ^{*}\), calculate the corresponding optimal \(\alpha =\alpha (s,\beta ^{*})=\alpha ^{*}\) (with \(1{\lt}\alpha ^{*}{\lt}\beta ^{*}\)) as </p>
<div class="equation" id="K9alpha">
<p>
  <div class="equation_content">
    \begin{equation} \label{K9alpha} \alpha ^{*}={\rm Root[}K_{9,s,\beta ^{*}},3{\rm ]}. \end{equation}
  </div>
  <span class="equation_label">5.15</span>
</p>
</div>
<p> For the special choice \(s=1/7\) calculate the corresponding optimal \(\alpha ^{*}\) and \(\beta ^{*}\) as </p>
<div class="equation" id="s17alphabeta">
<p>
  <div class="equation_content">
    \begin{equation} \label{s17alphabeta} \alpha ^{*}\! =\! {\rm Root[}f_9,3{\rm ]}\! =\! 1.40565\dots \,  {\rm respectively} \,  \beta ^{*}\! =\! {\rm Root[}g_9,3 {\rm ]}\! =\! 1.42240\dots \, , \end{equation}
  </div>
  <span class="equation_label">5.16</span>
</p>
</div>
<p> where </p>
<div class="displaymath" id="f79">
  \begin{align}  f_9(\alpha )=-289327 - 2055393 \alpha - 3863708 \alpha ^2 - 2195188 \alpha ^3 + 207262 \alpha ^4 \label{f79}\\ +10020402 \alpha ^5 + 7009300 \alpha ^6 - 10930500 \alpha ^7 - 4134375 \alpha ^8 + 4134375 \alpha ^9 \nonumber \end{align}
</div>
<p> and </p>
<div class="displaymath" id="g79">
  \begin{align} & g_9(\beta )= \label{g79}\\ & =1375897 - 23273607 \beta + 138777636 \beta ^2 - 351747852 \beta ^3 + 390461870 \beta ^4 - \nonumber \\ & \  \  -40305346 \beta ^5 - 356725100 \beta ^6 + 382378500 \beta ^7 - 169509375 \beta ^8 + 28940625 \beta ^9. \nonumber \end{align}
</div>
<p> (iii) Then replace in the expression <span class="rm">(<a href="#Z7b">5.10</a>)</span> above, the parameter \(\alpha \) by the real number \(\alpha ^*{\gt}1\) and the parameter \(\beta \) by the real number \(\beta ^{*}{\gt}1\) (with \(1{\lt}\alpha ^*{\lt}\beta ^*\)) and rearrange terms in order to obtain a power form representation of the septic polynomial in the variable \(x\). Its coefficients \(a_{k,7}(\alpha ^{*},\beta ^{*})\) agree with the optimal coefficients \(a^{*}_{k,7}(s)\), for \(k=0,\dots ,5\), of the sought-for monic proper Zolotarev polynomial \(Z^{*}_{7,s}\). Finally, evaluate \(Z^{*}_{7,s}(x)\) at \(x=1\) in order to get, up to sign, the real number \(L(\alpha ^*,\beta ^*)=L^*\) in <span class="rm">(<a href="#L7b">5.11</a>)</span>, the least deviation of \(Z^{*}_{7,s}\) on \(\boldsymbol {I}\) from the zero-function. <span class="qed">â–¡</span></p>

  </div>
</div> <div class="remark_thmwrapper " id="a0000000040">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">5.4</span>
  </div>
  <div class="remark_thmcontent">
  <p>The just described step allows to generate numerical values of arbitrary precision for the optimal coefficients \(a^{*}_{k,7}(s)\) of \(Z^{*}_{7,s}\) and can be accomplished, for \(s\neq 1/7\), by executing the following <em>Mathematica</em> call (where \(Z7\alpha \beta =Z_{7,\alpha ,\beta }\), \(G12s=G_{12,s}\) and \(K9s\beta =K_{9,s,\beta }\) and \(s_0\) is an assigned fixed value for \(s\), and \(\kappa =3,4,6\) according to the position of \(s\) on the positive \(x\)-axis, and \(p\) is an assigned fixed integer value for the \(p\)-digit precision of the numerical result): </p>
<div class="equation" id="M7call">
<p>
  <div class="equation_content">
    \begin{equation} \label{M7call} \begin{split} & {\bf N[}Z7\alpha \beta /.\beta \! \! \rightarrow \!  {\bf Root[}G12s/.s\rightarrow \!  s_0,\kappa {\bf ]} /.\alpha \! \! \rightarrow \\ & {\bf Root[}K9s\beta /.\beta \rightarrow {\bf Root[}G12s,s/.\rightarrow s_0,\kappa {\bf ]}/.s\rightarrow \!  s_0,3],p{\bf ]//Expand} \end{split} \end{equation}
  </div>
  <span class="equation_label">5.19</span>
</p>
</div>
<p> Likewise as for \(n=6\), if we assume that \(s{\gt}\tan ^2(\pi /14)\) is an integer or a rational number \(a/b\), then we can explicitly express each \(a^{*}_{k,7}(s)\) as a root object \({\rm Root[}P_{12},k{\rm ]}\) (where \(P_{12}\) is a dedicated integer polynomial of degree twelve), for example by executing the <em>Mathematica</em> call <b class="bf">RootReduce</b>. </p>

  </div>
</div> <div class="example_thmwrapper " id="exampled7s27">
  <div class="example_thmheading">
    <span class="example_thmcaption">
    Example
    </span>
    <span class="example_thmlabel">5.5</span>
  </div>
  <div class="example_thmcontent">
  <p> The goal is to determine \(Z^{*}_{7,s=2/7}\), the septic proper monic Zolotarev polynomial with parameter \(s=s_0=2/7=0.28571\dots {\gt}\tan ^2(\pi /14)\) and \(L^*\), its least deviation from the zero-function on \(\boldsymbol {I}\). We get with \(s=2/7\) </p>
<div class="displaymath" id="a0000000041">
  \begin{align} & G_{12,s}(\beta )=\\ =& 114017536 \! -\!  370762752 \beta \! -\!  72818688 \beta ^2 + 1295790848 \beta ^3 \! -\!  812143744 \beta ^4 \!  \nonumber \\ &  -1467020480 \beta ^5 + 1711977904 \beta ^6 + 351336256 \beta ^7 - 1196850736 \beta ^8 \nonumber \\ &  + 360786800 \beta ^9 + 231651000 \beta ^{10} - 165375000 \beta ^{11} + 28940625 \beta ^{12} \nonumber \end{align}
</div>
<p> and hence \(\beta ^{*}={\rm Root[}G_{12,s},4{\rm ]}=2.23672\dots \, \). Furthermore we get (with \(s=2/7\) and \(\beta ^{*}= 2.23672\dots \)) \(\alpha ^{*}={\rm Root[}K_{9,s,\beta ^{*}},3{\rm ]}=2.23541\dots \, \). </p>
<p>Inserting these real numbers into the expression <span class="rm">(<a href="#Z7b">5.10</a>)</span> and rearranging yields </p>
<div class="displaymath" id="a0000000042">
  \begin{align} & Z^{*}_{7,s=2/7}(x)=0.05920\dots +(-0.18072\dots )x+(-1.09752\dots )x^2 \\ & +1.16679\dots x^3+2.97213\dots x^4+(-1.98606\dots )x^5+(-2)x^6+x^7, \nonumber \end{align}
</div>
<p> and evaluating \(|Z^{*}_{7,s=2/7}(1)|\) yields </p>
<div class="equation" id="a0000000043">
<p>
  <div class="equation_content">
    \begin{equation}  L^{*}=0.06618\dots \, . \end{equation}
  </div>
  <span class="equation_label">5.24</span>
</p>
</div>
<p> Upon using the <em>Mathematica</em> <b class="bf">RootReduce</b> call we would get here the following explicit algebraic expression for \(a^{*}_{5,7}\) by means of a root object (and similar expressions for the other coefficients): </p>
<div class="displaymath" id="coeffa57s27">
  \begin{align} & a^{*}_{5,7}(s=2/7)= \label{coeffa57s27}\\ & ={\rm Root[}-873554110083 - 4116902938848 x - 2952492262344 x^2 \nonumber \\ &  \  \  +20299695208200 x^3 + 65095318796016 x^4 + 97104326777504 x^5 \nonumber \\ &  \  \  +91201373079984 x^6 + 61157144577920 x^7 + 31360014030976 x^8 \nonumber \\ &  \  \  + 12198778044800 x^9 + 3294494784000 x^{10} + 529200000000 x^{11} \nonumber \\ &  \  \  +37044000000 x^{12}, 2{\rm ]}. \nonumber \end{align}
</div>
<p> In Fig. <a href="#figure 3">3</a> the graph of \(Z^{*}_{7,s=2/7}\) on \(\boldsymbol {I}\) is displayed. <span class="qed">â–¡</span></p>
<figure id="figure 3">
  <div class="centered"> <img src="img-0003.png" alt="\includegraphics[width=3.0in]{GraphForZol3a.png}" style="width:3.0in" />
 </div>
<figcaption>
  <span class="caption_title">Figure</span> 
  <span class="caption_ref">3</span> 
  <span class="caption_text">\(Z^{*}_{7,\frac{2}{7}}\).</span> 
</figcaption>


</figure>

  </div>
</div> </p>
<h1 id="hosection">6 Explicit algebraic solution to <i class="it">ZFP</i> for polynomials of degree \(n{\gt}7\)</h1>
<p> As mentioned before, for \(n\in \{ 8,9,10,11,12\} \) we transfer our contributions to <i class="it">ZFP</i> to a web-based repository <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span> due to the bulky terms that occur for those values of \(n\). </p>
<p>In particular, we store there </p>
<ul class="itemize">
  <li><p>the Malyshev polynomials \(F_{m(n),s}\) and \(G_{m(n),s}\) of degree \(m(8)=16\), \(m(9)=18\), \(m(10)=24, m(11)=30\) and \(m(12)=32\), </p>
</li>
  <li><p>the recursive solution formulas for \(n\in \{ 8,9,10,11,12\} \), similar to those given in Theorem <a href="#thm41">4.1</a> and <a href="#thm51">5.1</a>, </p>
</li>
  <li><p>the tentative terms \(Z_{n,\alpha ,\beta }\) for \(Z_{n,s}\) if \(n\in N\), including their coefficients when \(Z_{n,\alpha ,\beta }\) is expanded in power form. </p>
</li>
</ul>
<p>In our second solution path the algebraic equation for the unknown variable \(y\) (see the proofs of Theorem <a href="#thm42">4.3</a> and <a href="#thm52">5.2</a> in Section <a href="#proofsection">7</a>) is of degree \(5\) if \(n=12\), see <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Formula (26)
	]
</span>, so that \(Z_{12,\alpha , \beta }\) may contain root objects. </p>
<p>In Fig. <a href="#figure 4">4</a> the graph of \(Z_{n,s}\) is displayed on \(\boldsymbol {I}\) for \(n=12\) and \(s=1\), used as an example for a solution of <i class="it">ZFP</i> for polynomials of degree \(n=12\). </p>
<figure id="figure 4">
  <div class="centered"> <img src="img-0004.png" alt="\includegraphics[width=3.0in]{GraphForZol4b.png}" style="width:3.0in" />
 </div>
<figcaption>
  <span class="caption_title">Figure</span> 
  <span class="caption_ref">4</span> 
  <span class="caption_text">\(Z^{*}_{12,1}\).</span> 
</figcaption>


</figure>
<h1 id="proofsection">7 Proofs</h1>
<p> A detailed proof of Theorems <a href="#thm41">4.1</a> and <a href="#thm51">5.1</a>, which is based on executed <em>Mathematica</em> calls, is provided in <span class="cite">
	[
	<a href="#zfpr" >53</a>
	]
</span>. <div class="proof_wrapper" id="a0000000044">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>[Proof of Theorem <a href="#thm42">4.3</a>] We shall pursue a modification of the approach as given in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span>. A tentative parameterized version of the sought-for proper Zolotarev polynomial \(Z_{6,s}\) can be given, for \(n=2m+2=6\), as follows: </p>
<div class="equation" id="formula81">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula81} \begin{split} & Z_{6,\alpha ,\beta ,y_1,y_2}(x)=\\ & =(x-1)(x-\alpha )(x-y_1)^2(x-y_2)^2-\tfrac {1}{2}(\beta -1)(\beta -\alpha )(\beta -y_1)^2(\beta -y_2)^2. \end{split} \end{equation}
  </div>
  <span class="equation_label">7.1</span>
</p>
</div>
<p> This is the corrected version (for \(n=6\)) of the misprinted second equation in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Formula (37)
	]
</span>, see the updated version of <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span> on professor K. Schiefermayr’s homepage <a href ="http://research.fh-ooe.at/de/publication/2410"><span class="tt">http://research.fh-ooe.at/de/publication/2410</span></a>. </p>
<p>Here, \(\alpha \) and \(\beta \) are the (undetermined) endpoints of the alternation interval \([\alpha ,\beta ]\) to the right of \(\boldsymbol {I}\), and \(y_1\) and \(y_2\) are the (undetermined) alternation points in the interior of \(\boldsymbol {I}\) where \(Z_{6,s}\) is to attain the value \(-L\). To determine the optimal values of \(y_1\) and \(y_2\) we utilize Formula (26) of <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Theorem 2
	]
</span> which amounts to solve, for \(n=6\), a quadratic equation in the variable \(y\) and with coefficients which are certain well-defined determinants. After evaluation of these determinants, the quadratic equation in \(y\) reads as follows: </p>
<div class="displaymath" id="formula82">
  \begin{align}  \label{formula82} & 0= 256 - 3 \alpha ^8 - 8 \alpha ^7 \beta + 512 \beta ^2 - 864 \beta ^4 + 128 \beta ^6 - 35 \beta ^8 + \alpha ^6 (64 - 52 \beta ^2) \\ \nonumber & + 24 \alpha ^5 \beta (-8 + 11 \beta ^2) + \alpha ^4 (160 + 256 \beta ^2 - 306 \beta ^4) + 24 \alpha ^3 \beta (16 - 16 \beta ^2 + 3 \beta ^4) \\ \nonumber &  +8 \alpha \beta ^3 (48 - 56 \beta ^2 + 7 \beta ^4) + 4 \alpha ^2 (-128 - 16 \beta ^2 + 144 \beta ^4 + 3 \beta ^6) + 16 y (\alpha + \beta )^2 \cdot \end{align}
</div>
<div class="displaymath" id="a0000000045">
  \begin{align*} & \cdot (\alpha ^5 + 3 \alpha ^4 \beta + \alpha ^3 (24 - 22 \beta ^2) - 3 \alpha (4 - 3 \beta ^2)^2 + \alpha ^2 (-40 \beta + 38 \beta ^3) + \beta (48 \\ &  -56 \beta ^2 + 7 \beta ^4)) + 16 y^2 (-64 - \alpha ^6 - 6 \alpha ^5 \beta + 16 \beta ^2 + 52 \beta ^4 - 5 \beta ^6 - 4 \alpha ^3 \beta (-4 \\ &  +9 \beta ^2) + \alpha ^4 (-44 + 29 \beta ^2) + 2 \alpha \beta (-48 + 40 \beta ^2 + 5 \beta ^4) + \alpha ^2 (80 - 104 \beta ^2 + 9 \beta ^4)). \end{align*}
</div>
<p> Computing its solutions \(y_1\) and \(y_2\) and inserting them into the representation (<a href="#formula81">7.1</a>) yields, after simplifications, the identity (<a href="#Z6b">4.15</a>). </p>
<p>From (<a href="#Z6b">4.15</a>) we extract here only the coefficient \(a_{5,6}(\alpha , \beta )\), which must be equal to \(-6s\), and in this way we obtain, after division by \((-6)\), a representation of \(s\) which depends solely on \(\alpha \) and \(\beta \) </p>
<div class="equation" id="formula83">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula83} \begin{split} & s(\alpha ,\beta ):=\tfrac {1}{6}\times \\ & \times \left(1\!  +\!  \alpha \!  +\!  (2(\alpha \!  +\!  \beta )^2 (\alpha ^5\!  +\!  3 \alpha ^4 \beta \! +\!  \alpha ^3 (24 \! -\!  22 \beta ^2) - 3 \alpha (4 \! -\!  3 \beta ^2)^2\!  +\!  \alpha ^2 (-40 \beta \right. \\ &  +38 \beta ^3)\!  +\!  \beta (48 \! -\!  56 \beta ^2 \! +\!  7 \beta ^4)))/(64 \! +\!  \alpha ^6 \! +\!  6 \alpha ^5 \beta \! -\!  16 \beta ^2 \! -\!  52 \beta ^4\!  +\!  5 \beta ^6 + \alpha ^4 (44 \\ & \left. -29 \beta ^2) \! +\!  4 \alpha ^3 \beta (-4 \! +\!  9 \beta ^2) \! +\!  \alpha ^2 (-80 \! +\!  104 \beta ^2 \! -\!  9 \beta ^4) \! -\!  2 \alpha \beta (-48 \! +\!  40 \beta ^2 \! +\!  5 \beta ^4))\right). \end{split} \end{equation}
  </div>
  <span class="equation_label">7.5</span>
</p>
</div>
<p>With the goal to find the optimal values of the parameters \(\alpha \) and \(\beta \) we deploy Formula (34) of <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Corollary 3
	]
</span> which is a bivariate polynomial equation in the variables \(\alpha \) and \(\beta \). After evaluation of the well-defined determinants occurring there and after simplification we arrive at the following identity </p>
<div class="equation" id="formula84">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula84} \begin{split} & 0=h(\alpha ,\beta ):=\\ &  -(2 + \alpha - \beta ) (256 + \alpha ^8 - 8 \alpha ^7 (-2 + \beta ) - 8 \alpha ^3 (32 + 48 \beta + \beta ^3 (2 + \beta ) (-36 \\ &  +7 \beta )) + 4 \alpha ^6 (-20 + \beta (20 + 7 \beta )) - 8 \alpha ^5 (-32 + \beta (4 + 7 \beta (2 + \beta ))) + 4 \alpha ^2 (-64 \\ &  +\beta (-64 + 144 \beta + \beta ^3 (-44 + 7 \beta (4 + \beta )))) + 2 \alpha ^4 (48 + \beta (128 + \beta (-88 + \beta \\ &  (-88 + 35 \beta )))) + \beta ^2 (-256 + \beta (256 + \beta (96 + \beta (-256 + (-20 + \beta ) \beta (4 + \beta )))))\\ &  - 8 \alpha \beta (-64 + \beta (-32 + \beta (48 + \beta (32 + \beta (4 + \beta (10 + \beta ))))))). \end{split} \end{equation}
  </div>
  <span class="equation_label">7.10</span>
</p>
</div>
<p>The first factor, \(-(2+\alpha -\beta )\), we may neglect as it does not contribute to our overall goal to determine \(Z_{6,s}\), as we have convinced ourselves in an auxiliary calculation, see also the analogous exclusion carried out in our first solution path. We now merge equation (<a href="#formula83">7.5</a>) with the equation \(\tilde{h}(\alpha ,\beta )=0\), which is (<a href="#formula84">7.10</a>), but with factor \(-(2+\alpha -\beta )\) deleted. This we accomplish with the <em>Mathematica</em> call </p>
<div class="equation" id="formula85">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula85} \begin{split}  {\bf Reduce[}& \tilde{h}(\alpha ,\beta )==0 \, \wedge \,  s==s(\alpha ,\beta ) \, \wedge \, s>\tan ^2\left(\tfrac {\pi }{12}\right) \, \wedge \\ & 1<\alpha <\beta \, \wedge \,  \beta >1+2\tan ^2\left(\tfrac {\pi }{12}\right),\{ \alpha \} {\bf ]} \end{split} \end{equation}
  </div>
  <span class="equation_label">7.17</span>
</p>
</div>
<p> and with the analogous call when solving for \(\beta \). </p>
<p>The outcome of these reductions is that for an assigned fixed \(s{\gt}\tan ^2\left(\pi /12\right)\), but \(s\neq 1/3\), the optimal parameters \(\alpha ^{*}\) and \(\beta ^{*}\) are to be determined as indicated in (<a href="#alphabeta1">4.17</a>), that is, as certain positive roots \({\gt}1\) of \(F_{8,s}\) and \(G_{8,s}\) as given in (<a href="#F8a">3.4</a>), (<a href="#G8a">3.5</a>) and, for \(s=1/3\), as roots of \(f_6\) and \(g_6\) as given in (<a href="#f66">4.19</a>) and (<a href="#g66">4.20</a>). <div class="proof_wrapper" id="a0000000046">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> <div class="proof_wrapper" id="a0000000047">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div>[Proof of Theorem <a href="#thm52">5.2</a>] We shall pursue a modification of the approach as given in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span>. A tentative parameterized version of the sought-for proper Zolotarev polynomial \(Z_{7,s}\) can be given, for \(n=2m+1=7\), as follows: </p>
<div class="equation" id="formula86">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula86} \begin{split} & Z_{7,\alpha ,\beta ,y_1,y_2}(x)=\\ & =(x-\alpha )(x^2-1)(x-y_1)^2(x-y_2)^2-\tfrac {1}{2}(\beta -\alpha )(\beta ^2-1)(\beta -y_1)^2(\beta -y_2)^2. \end{split} \end{equation}
  </div>
  <span class="equation_label">7.20</span>
</p>
</div>
<p> This agrees with the second equation of Formula (36) in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span>. </p>
<p>Here, \(\alpha \) and \(\beta \) are the (undetermined) endpoints of the alternation interval \([\alpha ,\beta ]\) to the right of \(\boldsymbol {I}\), and \(y_1\) and \(y_2\) are the (undetermined) alternation points in the interior of \(\boldsymbol {I}\) where \(Z_{7,s}\) is to attain the value \(-L\). To determine the optimal values of \(y_1\) and \(y_2\) we utilize Formula (22) of <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Theorem 1
	]
</span> which amounts to solve, for \(n=7\), a quadratic equation in the variable \(y\) and with coefficients which are certain well-defined determinants. After evaluation of these determinants, the quadratic equation in \(y\) reads as follows: </p>
<div class="equation" id="formula87">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula87} \begin{split} & 0=\\ &  -1024 \! +\!  1280 \alpha ^2 \! +\!  384 \alpha ^4 - 736 \alpha ^6 + 44 \alpha ^8 - 7 \alpha ^{10} - 512 \alpha \beta + 512 \alpha ^3 \beta + 64 \alpha ^5 \beta \\ &  -224 \alpha ^7 \beta + 14 \alpha ^9 \beta + 1280 \beta ^2 - 1792 \alpha ^2 \beta ^2 + 224 \alpha ^4 \beta ^2 + 464 \alpha ^6 \beta ^2 + 5 \alpha ^8 \beta ^2 \\ &  +512 \alpha \beta ^3 + 896 \alpha ^3 \beta ^3 - 544 \alpha ^5 \beta ^3 + 40 \alpha ^7 \beta ^3 + 384 \beta ^4 + 224 \alpha ^2 \beta ^4 + 520 \alpha ^4 \beta ^4 \\ &  -254 \alpha ^6 \beta ^4 + 64 \alpha \beta ^5 - 544 \alpha ^3 \beta ^5 + 404 \alpha ^5 \beta ^5 - 736 \beta ^6 + 464 \alpha ^2 \beta ^6 - 254 \alpha ^4 \beta ^6 \\ &  -224 \alpha \beta ^7 \! +\!  40 \alpha ^3 \beta ^7 \! +\!  44 \beta ^8 \! +\!  5 \alpha ^2 \beta ^8 \! +\!  14 \alpha \beta ^9 \! -\!  7 \beta ^{10} \! -\!  8 y^2 (-4 \! +\!  \alpha ^2 + (-4 + \beta ) \beta \\ &  - 2 \alpha (2 + \beta )) (-4 + \alpha ^2 - 2 \alpha (-2 + \beta ) + \beta (4 + \beta )) (-4 + (\alpha - \beta ) (3 \alpha + \beta )) (4 \\ & +(\alpha - \beta ) (\alpha + 3 \beta )) + 4 y (\alpha + \beta ) (-256 + (\alpha - \beta )^2 (256 + 32 \alpha ^2 + 7 (-4 + \alpha ) \alpha ^4\\ &  (4 \! +\!  \alpha ) \! +\!  448 \alpha \beta - 10 \alpha ^3 (32 + \alpha ^2) \beta + (32 - 160 \alpha ^2 - 23 \alpha ^4) \beta ^2 + 4 \alpha (-80 + 13 \alpha ^2) \\ &  \beta ^3 - (112 + 23 \alpha ^2) \beta ^4 - 10 \alpha \beta ^5 + 7 \beta ^6)). \end{split} \end{equation}
  </div>
  <span class="equation_label">7.23</span>
</p>
</div>
<p> Computing its solutions \(y_1\) and \(y_2\) and inserting them into the representation (<a href="#formula86">7.20</a>) yields, after simplifications, the identity (<a href="#Z7b">5.10</a>). </p>
<p>From (<a href="#Z7b">5.10</a>) we extract here only the coefficient \(a_{6,7}(\alpha , \beta )\), which must be equal to \(-7s\), and in this way we obtain, after division by \((-7)\), a representation of \(s\) which depends solely on \(\alpha \) and \(\beta \) </p>
<div class="displaymath" id="formula88">
  \begin{align} \label{formula88} s(\alpha ,\beta ):=& \tfrac {1}{63}\Big(14\alpha +21\beta \\ \nonumber & +\tfrac {72(1+\alpha )(1+\beta )}{-4+\alpha ^2+(-4+\beta )\beta -2\alpha (2+\beta )}-\tfrac {72(-1+\alpha )(-1+\beta )}{-4+\alpha ^2-2\alpha (-2+\beta )+\beta (4+\beta )} \\ \nonumber &  +\tfrac {36(-1+\alpha ^2)(\alpha -\beta )}{-4+(\alpha -\beta )(3\alpha +\beta )}+\tfrac {4\alpha (-5+\alpha ^2)-4(3+\alpha ^2)\beta }{4+(\alpha -\beta )(\alpha +3\beta )}\Big). \end{align}
</div>
<p> With the goal to find the optimal values of the parameters \(\alpha \) and \(\beta \) we utilize Formula (32) of <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Corollary 3
	]
</span> which is a bivariate polynomial equation in the variables \(\alpha \) and \(\beta \). After evaluation of the well-defined determinants occurring there and after simplification we arrive at the following identity </p>
<div class="equation" id="formula89">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula89} \begin{split} & 0=h(\alpha ,\beta ):=\\ & =4096 + \alpha ^{12} + 12 \alpha ^{11} \beta - 10240 \beta ^2 + 14080 \beta ^4 - 9984 \beta ^6 + 1776 \beta ^8 + 280 \beta ^{10} \\ & - 7 \beta ^{12} \! +\!  2 \alpha ^{10} (92 \! -\!  59 \beta ^2) \! +\!  4 \alpha ^9 \beta (-36 \! +\!  91 \beta ^2) + \alpha ^8 (-1040 \! +\!  1976 \beta ^2 - 441 \beta ^4) \\ &  -8 \alpha ^5 \beta (-192 + 1328 \beta ^2 - 1460 \beta ^4 + 225 \beta ^6) + 4 \alpha ^6 (1856 - 1072 \beta ^2 - 868 \beta ^4 \\ &  +315 \beta ^6) \! +\!  4 \alpha (-2 \! +\!  \beta ) \beta (2 \! +\!  \beta ) (-768 \! +\!  640 \beta ^2 \! -\!  192 \beta ^4 \! +\!  312 \beta ^6 + 7 \beta ^8) - 4 \alpha ^3 \beta \\ & (4352 \! -\!  8448 \beta ^2 \! +\!  4832 \beta ^4 \! -\!  912 \beta ^6 + 121 \beta ^8) + 3 \alpha ^4 (-2816 - 2816 \beta ^2 + 7904 \beta ^4 \\ & -2544 \beta ^6 + 437 \beta ^8) - 24 \alpha ^7 \beta (-208 + 7 \beta ^2 (24 + \beta ^2)) + 2 \alpha ^2 (-1024 + 12544 \beta ^2 \\ & +3 \beta ^4 (-4992 + 1760 \beta ^2 - 604 \beta ^4 + 7 \beta ^6)). \end{split} \end{equation}
  </div>
  <span class="equation_label">7.35</span>
</p>
</div>
<p> We now merge equation (<a href="#formula88">7.34</a>) with equation (<a href="#formula89">7.35</a>). This we accomplish with the <em>Mathematica</em> call </p>
<div class="equation" id="formula810">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula810} \begin{split}  {\bf Reduce[}& h(\alpha ,\beta )==0 \, \wedge \,  s==s(\alpha ,\beta ) \, \wedge \, s>\tan ^2\left(\tfrac {\pi }{14}\right) \, \wedge \\ & 1<\alpha <\beta \, \wedge \,  \beta >1+2\tan ^2\left(\tfrac {\pi }{14}\right),\{ \alpha \} {\bf ]} \end{split} \end{equation}
  </div>
  <span class="equation_label">7.44</span>
</p>
</div>
<p> and with the analogous call when solving for \(\beta \). The outcome of this reduction is that for an assigned fixed \(s{\gt}\tan ^2\left(\pi /14\right)\), but \(s\neq 1/7\), the optimal parameters \(\alpha ^{*}\) and \(\beta ^{*}\) are to be determined as indicated in (<a href="#beta1a">5.12</a>)–(<a href="#K9alpha">5.15</a>). </p>
<p>For the special case \(s=1/7\) the above reduction implies that the optimal parameters \(\alpha ^*\) and \(\beta ^{*}\) are to be determined as indicated in (<a href="#s17alphabeta">5.16</a>), (<a href="#f79">5.17</a>), (<a href="#g79">5.18</a>). <div class="proof_wrapper" id="a0000000048">
  <div class="proof_heading">
    <span class="proof_caption">
    Proof
    </span>
    <span class="expand-proof">â–¼</span>
  </div>
  <div class="proof_content">
  
  </div>
</div> </p>
<h1 id="a0000000049">8 Concluding remarks</h1>
<p> <div class="remark_thmwrapper " id="a0000000050">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">8.1</span>
  </div>
  <div class="remark_thmcontent">
  <p>S. N. Bernstein provided the following asymptotic approximation, \(L_{\infty }\), to the constant \(L\), the least deviation of the proper monic Zolotarev polynomial from the zero-function on \(\boldsymbol {I}\) (see <span class="cite">
	[
	<a href="#Bernstein1913" >3</a>
	, 
	p. 1057
	]
</span>, <span class="cite">
	[
	<a href="#Bernstein1926" >4</a>
	, 
	p. 24
	]
</span>, <span class="cite">
	[
	<a href="#Bernstein1952" >5</a>
	, 
	p. 208
	]
</span> and also <span class="cite">
	[
	<a href="#Peherstorfer06" >32</a>
	]
</span>): </p>
<div class="equation" id="formula94">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula94} L_{\infty }=\frac{ns+\sqrt{n^2 s^2+1}}{2^{n-1}}\quad (n\to \infty ). \end{equation}
  </div>
  <span class="equation_label">8.1</span>
</p>
</div>
<p> Upon comparing \(L_{\infty }\) to the special instances of \(L\) which we have obtained in Examples <a href="#exampled6s1r">4.2</a>, <a href="#exampled6s18">4.6</a>, <a href="#exampled7s27">5.5</a>, one observes that Bernstein’s formula is quite satisfactory. </p>
<p>We note that Bernstein also addressed the computational complexity he encountered when he tried to determine the uniform norm of \(Z_{n,s}\) <span class="cite">
	[
	<a href="#Bernstein1952" >5</a>
	, 
	p. 511
	]
</span>: <em>When I first considered this same problem [of determining \(L\)] in 1913, I soon recognized its algebraic difficulties, which increase rapidly with the degree \(n\) of the polynomial, and it occurred to me to formulate the asymptotic problem.</em> </p>

  </div>
</div> <div class="remark_thmwrapper " id="a0000000051">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">8.2</span>
  </div>
  <div class="remark_thmcontent">
  <p>It is known that \(\alpha =\alpha (n,s)\) and \(\beta =\beta (n,s)\) converge to \(ns\), the negative second leading coefficient of the proper monic Zolotarev polynomial \(Z_{n,s}\), when \(n\to \infty \), see <i class="it">e.g.</i> <span class="cite">
	[
	<a href="#Peherstorfer99b" >30</a>
	, 
	p.
	
	69
	]
</span>. For \(n\in N\) we have in particular </p>
<div class="equation" id="formula95">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula95} |\alpha -ns|<1, \quad |\beta -ns|<1 \quad {\rm and}\quad \left|\tfrac {\alpha +\beta }{2}-n s\right|<1. \end{equation}
  </div>
  <span class="equation_label">8.2</span>
</p>
</div>
<p> These inequalities turn out to be useful in checking calculations or reducing search trees in connection with <i class="it">ZFP</i>. To prove (<a href="#formula95">8.2</a>), we use Formulas (30), (31) in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span> which are based on the \(y_j\) (alternation points in the interior of \(\boldsymbol {I}\) where the value \(-L\) is attained). But we also need the analogous formulas based on the \(x_j\) (alternation points in the interior of \(\boldsymbol {I}\) where the value \(L\) is attained) which are not given in <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	]
</span>. These formulas read: </p>
<div class="equation" id="formula96">
<p>
  <div class="equation_content">
    \begin{equation} \label{formula96} 2\sum _{j=1}^{m}x_j+\beta =ns \, \, (n=2m+1) \quad {\rm and}\quad 2 \sum _{j=1}^{m} x_j+\beta -1=ns \, \, (n=2m+2). \end{equation}
  </div>
  <span class="equation_label">8.3</span>
</p>
</div>
<p> The analogous proof rests on Vieta’s theorem applied to the polynomial \(Z_{n,s}-L\). Inequalities (<a href="#formula95">8.2</a>) then follow from <span class="cite">
	[
	<a href="#Schiefermayr07" >41</a>
	, 
	Formulas (30), (31)
	]
</span> and (<a href="#formula96">8.3</a>) by considering the transformation of the graph of \(Z_{n,s}\) when \(s\) tends towards the boundaries of the interval \((\tan ^2\left(\pi /(2n)\right),\infty )\), see <span class="cite">
	[
	<a href="#Achieser98" >1</a>
	, 
	p. 19
	]
</span>, <span class="cite">
	[
	<a href="#Lebedev94" >18</a>
	, 
	pp. 247-248
	]
</span>. </p>

  </div>
</div> <div class="remark_thmwrapper " id="rempar">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">8.3</span>
  </div>
  <div class="remark_thmcontent">
  <p>In the absence of explicit algebraic solutions to <i class="it">ZFP</i> several authors have provided approximate solutions, for example by economization (<i class="it">i.e.</i>, expanding \(Z_{n,s}\) in terms of Chebyshev polynomials and cutting off tails), see <span class="cite">
	[
	<a href="#Farkhutdinova" >11</a>
	]
</span>, <span class="cite">
	[
	<a href="#Haussmann" >15</a>
	]
</span>, <span class="cite">
	[
	<a href="#Lozner" >19</a>
	]
</span>. </p>

  </div>
</div> <div class="remark_thmwrapper " id="openqrem">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">8.4</span>
  </div>
  <div class="remark_thmcontent">
  <p> It is an open problem to investigate which type of explicit parameterized representation (rational, radical, etc.) exists for proper Zolotarev polynomials, if \(n{\gt}5\), see Section <a href="#Known25">2</a>. Based on the methods and results of the present paper, we intend to address this problem in a future joint research project. <i class="it">Added in proof</i>: See our recent one-parameter power form solution for \(n=6\) in <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	]
</span>. </p>

  </div>
</div> <div class="remark_thmwrapper " id="a0000000052">
  <div class="remark_thmheading">
    <span class="remark_thmcaption">
    Remark
    </span>
    <span class="remark_thmlabel">8.5</span>
  </div>
  <div class="remark_thmcontent">
  <p>The degrees of the Malyshev polynomials for \(n=2,3,4,5\) (see <span class="cite">
	[
	<a href="#Malyshev03" >21</a>
	]
</span>) and for \(n \in N\) (see (<a href="#F8a">3.4</a>)-(<a href="#G12a">3.7</a>) and Section <a href="#hosection">6</a>) coincide with the first eleven elements of the sequence A055932 in the database OEIS (see <span class="tt">oeis.org</span>). </p>

  </div>
</div> </p>
<p><i class="it">Note added in proof.</i> After the submission of the present paper, we have addressed the open problem as described in Remark <a href="#openqrem">8.4</a> above. We have shown in Theorem 3.1 of <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	]
</span> that, for \(n=6\), an explicit univariate and radical parametrization exists for proper Zolotarev polynomials with uniform norm \(1\) on the interval \([-1, 1]\). Thus there are now three methods available to solve ZFP algebraically for \(n=6\): According to Theorem <a href="#thm41">4.1</a> and Theorem <a href="#thm42">4.3</a> of the present paper, and according to the description at the end of Section <a href="#Known25">2</a> above which is exemplified in <span class="cite">
	[
	<a href="#RackVajda19" >38</a>
	, 
	Example 3.2
	]
</span>. </p>
<p><small class="footnotesize">  </small></p>
<div class="bibliography">
<h1>Bibliography</h1>
<dl class="bibliography">
  <dt><a name="Achieser98">1</a></dt>
  <dd><p><i class="sc">N.I. Achieser</i>, <i class="it">Function theory according to Chebyshev</i>. In: Mathematics of the 19th century, Vol. 3 (A.N. Kolmogorov et al. (Eds.)), Birkhäuser, Basel, 1998, pp. 1-81 (Russian 1987). </p>
</dd>
  <dt><a name="Achieser03">2</a></dt>
  <dd><p><a href ="https://doi.org/10.2307/3612294"> <i class="sc">N.I. Achieser</i>, <i class="it">Theory of Approximation</i>, Dover Publications, Mineola (NY), USA, 2003 (Russian 1947). <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Bernstein1913">3</a></dt>
  <dd><p><i class="sc">S.N. Bernstein</i>, <i class="it">Sur quelques propriétés asymptotiques des polynomes</i>, C. R. <b class="bf">157</b> (1913), pp. 1055-1057. </p>
</dd>
  <dt><a name="Bernstein1926">4</a></dt>
  <dd><p><i class="sc">S.N. Bernstein</i>, <i class="it">Leçons sur les Propriétés Extrémales et la Meilleure Approximation des Fonctions Analytiques d’une Variable Réelle</i>, Gauthier-Villars, Paris, France, 1926. </p>
</dd>
  <dt><a name="Bernstein1952">5</a></dt>
  <dd><p><i class="sc">S.N. Bernstein</i>, <i class="it">Collected Works, Vol. I. Constructive Theory of Functions (1905- 1930)</i> (Russian), Akad. Nauk SSSR, Moscow, Russia, 1952. </p>
</dd>
  <dt><a name="Buchberger">6</a></dt>
  <dd><p><a href ="https://doi.org/10.1145/1088216.1088219"> <i class="sc">B. Buchberger</i>, <i class="it">Theoretical basis for the reduction of polynomials to canonical forms</i>, ACM SIGSAM Bull. (ACM) <b class="bf">10</b> (1976), pp. 19-29. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Carlson83">7</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/bf02189661"> <i class="sc">B.C. Carlson, J. Todd</i>, <i class="it">Zolotarev’s first problem - the best approximation by polynomials of degree \(\le n-2\) to \(x^n-n\sigma x^{n-1}\)</i> in \([-1,1]\), Aeq. Math <b class="bf">26</b> (1983), pp. 1–33.&#160;<img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Chebyshev">8</a></dt>
  <dd><p><a href ="http://www.math.technion.ac.il/hat/fpapers/cheb11.pdf"> <i class="sc">P.L. Chebyshev</i>, <i class="it">Théorie des mécanismes connus sous le nom de parallélogrammes</i>, Mem. Acad. Sci. St. Petersburg <b class="bf">7</b> (1854), pp. 539-568. URL <span class="tt">http://www.math.technion.ac.il/hat/fpapers/cheb11.pdf</span>&#160;<img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Collins96">9</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/978-3-0348-9208-7_19"> <i class="sc">G.E. Collins</i>, <i class="it">Application of quantifier elimination to Solotareff’s approximation problem</i>. In: Stability Theory (Hurwitz Centenary Conference, Ascona, Switzerland, 1995, R. Jeltsch et al. (Eds.)), Birkhäuser, Basel, ISNM <b class="bf">121</b> (1996), pp. 181-190. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Erdos42">10</a></dt>
  <dd><p><a href ="https://doi.org/10.2307/1968803"> <i class="sc">P. Erdős, G. Szegő</i>, <i class="it">On a problem of I. Schur</i>, Ann. Math. <b class="bf">43</b> (1942), pp. 451-470.&#160;<img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Farkhutdinova">11</a></dt>
  <dd><p><i class="sc">R.F. Farkhutdinova</i>, <i class="it">Approximate analytical formulas for the coefficients of Zolotarev polynomials and an economization process with the use of Zolotarev polynomials</i> (Russian). In: Uniform approximations and moment problems (Work Collection (Russian), M.Ja. Zinger (Ed.)), Vladivostok, Russia, 1977, pp. 126-135. </p>
</dd>
  <dt><a name="Grasegger16a">12</a></dt>
  <dd><p><a href ="http://www3.risc.jku.at/publications/download/risc_5271/RISCReport1602.pdf"> <i class="sc">G. Grasegger, N.Th. Vo</i>, <i class="it">An algebraic-geometric method for computing Zolotarev polynomials</i>, Technical Report no. 16-02 (RISC Report Series, Johannes Kepler University, Linz, Austria), 2016, pp. 1-17. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Grasegger16b">13</a></dt>
  <dd><p><a href ="http://www3.risc.jku.at/publications/download/risc_5340/RISC1607.pdf"> <i class="sc">G. Grasegger</i>, <i class="it">An algebraic-geometric method for computing Zolotarev polynomials - Additional information</i>, Technical Report no. 16-07 (RISC Report Series, Johannes Kepler University, Linz, Austria), 2016, pp. 1-12. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Grasegger17">14</a></dt>
  <dd><p><a href ="https://doi.org/10.1145/3087604.3087613"> <i class="sc">G. Grasegger, N.Th. Vo</i>, <i class="it">An algebraic-geometric method for computing Zolotarev polynomials</i>. In: Proceedings International Symposium on Symbolic and Algebraic Computation (ISSAC ’17, Kaiserslautern, Germany, M. Burr (Ed.)), ACM, New York, 2017, pp. 173-180. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Haussmann">15</a></dt>
  <dd><p><a href ="https://doi.org/10.1016/0898-1221(86)90237-3"> <i class="sc">W. Haussmann, K. Zeller</i>, <i class="it">Approximate Zolotarev polynomials</i>, Comput. Math. Appl. Part B12 (1986), pp. 1133-1140. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Kaltofen">16</a></dt>
  <dd><p><a href ="https://doi.org/10.1006/jsco.2000.0370"> <i class="sc">E. Kaltofen</i>, <i class="it">Challenges of symbolic computation: My favorite open problems</i>, J. Symb. Comput. <b class="bf">29</b> (2000), pp. 891-919. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Lazard">17</a></dt>
  <dd><p><a href ="https://doi.org/10.1145/1145768.1145803"> <i class="sc">D. Lazard</i>, <i class="it">Solving Kaltofen’s challenge on Zolotarev’s approximation</i>. In: Proceedings International Symposium on Symbolic and Algebraic Computation (ISSAC ’06, Genoa, Italy, B. Trager (Ed.)), ACM, New York, 2006, pp. 196-203. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Lebedev94">18</a></dt>
  <dd><p><a href ="https://doi.org/10.1515/rnam.1994.9.3.231"> <i class="sc">V.I. Lebedev</i>, <i class="it">Zolotarev polynomials and extremum problems</i>, Russ. J. Numer. Anal. Math. Model. <b class="bf">9</b> (1994), pp. 231-263. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Lozner">19</a></dt>
  <dd><p><i class="sc">L.G. Lozner</i>, <i class="it">Piecewise linear estimates of coefficients of Zolotarev polynomials</i>, Funkts. Anal. <b class="bf">34</b> (1993), pp. 35-39. </p>
</dd>
  <dt><a name="Malyshev02">20</a></dt>
  <dd><p><i class="sc">V.A. Malyshev</i>, <i class="it">The Abel equation</i>, St. Petersburg Math. J. <b class="bf">13</b> (2002), pp. 893-938 (Russian 2001). </p>
</dd>
  <dt><a name="Malyshev03">21</a></dt>
  <dd><p><i class="sc">V.A. Malyshev</i>, <i class="it">Algebraic solution of Zolotarev’s problem</i>, St. Petersburg Math. J. <b class="bf">14</b> (2003), pp. 711-712 (Russian 2002). </p>
</dd>
  <dt><a name="AAMarkov1889">22</a></dt>
  <dd><p><a href ="https://www.math.technion.ac.il/hat/fpapers/mar1.pdf"> <i class="sc">A.A. Markov</i>, <i class="it">On a question of D.I. Mendeleev</i> (Russian), Zapiski Imper. Akad. Nauk St. Petersburg <b class="bf">62</b> (1889), pp. 1-24. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="AAMarkov1906">23</a></dt>
  <dd><p><i class="sc">A.A. Markov</i>, <i class="it">Lectures on functions of minimal deviation from zero</i> (Russian), 1906. In: Selected Works: Continued fractions and the theory of functions deviating least from zero, OGIZ, Moscow-Leningrad, 1948, pp. 244-291. </p>
</dd>
  <dt><a name="VAMarkov">24</a></dt>
  <dd><p><a href ="http://www.math.technion.ac.il/hat/fpapers/vmar.pdf"> <i class="sc">V.A. Markov</i>, <i class="it">On functions deviating least from zero on a given interval</i> (Russian), Izdat. Akad. Nauk St. Petersburg 1892. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Milovanovic">25</a></dt>
  <dd><p><a href ="https://doi.org/10.1142/9789814360463"> <i class="sc">G.V. Milovanović, D.S. Mitrinović, Th.M. Rassias</i>, <i class="it">Topics in Polynomials: Extremal Problems, Inequalities, Zeros</i>, World Scientific, Singapore, 1994. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Paszkowski62">26</a></dt>
  <dd><p><i class="sc">S. Paszkowski</i>, <i class="it">The Theory of Uniform Approximation I. Non-asymptotic Theoretical Problems</i>, Rozprawy Matematyczne XXVI, PWN, Warsaw, 1962. </p>
</dd>
  <dt><a name="Peherstorfer90">27</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/bf01950935"> <i class="sc">F. Peherstorfer</i>, <i class="it">Orthogonal- and Chebyshev polynomials on two intervals</i>, Acta Math. Hung. <b class="bf">55</b> (1990), pp. 245-278. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Peherstorfer91">28</a></dt>
  <dd><p><a href ="https://doi.org/10.1016/0021-9045(91)90032-6"> <i class="sc">F. Peherstorfer</i>, <i class="it">On the connection of Posse’s \(L_1\)- and Zolotarev’s maximum- norm problem</i>, J. Approx. Theory <b class="bf">66</b> (1991), pp. 288-301. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Peherstorfer99a">29</a></dt>
  <dd><p><a href ="https://doi.org/10.1023/a:1006607401740"> <i class="sc">F. Peherstorfer, K. Schiefermayr</i>, <i class="it">Description of extremal polynomials on several intervals and their computation I</i>, Acta Math. Hungar. <b class="bf">83</b> (1999), pp. 27-58. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Peherstorfer99b">30</a></dt>
  <dd><p><a href ="https://doi.org/10.1023/a:1006659402649"> <i class="sc">F. Peherstorfer, K. Schiefermayr</i>, <i class="it">Description of extremal polynomials on several intervals and their computation, II</i>, Acta Math. Hungar. <b class="bf">83</b> (1999), pp. 59-83. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Peherstorfer04">31</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/bf03321075"> <i class="sc">F. Peherstorfer, K. Schiefermayr</i>, <i class="it">Description of inverse polynomial images which consist of two Jordan arcs with the help of Jacobi’s elliptic functions</i>, Comput. Methods Funct. Theory <b class="bf">4</b> (2004), pp. 355-390. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Peherstorfer06">32</a></dt>
  <dd><p><a href ="https://doi.org/10.1112/s0024610706022885"> <i class="sc">F. Peherstorfer</i>, <i class="it">Asymptotic representation of Zolotarev polynomials</i>, J. London Math. Soc. <b class="bf">74</b> (2006), pp. 143-153. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rack89">33</a></dt>
  <dd><p><a href ="https://doi.org/10.1016/0021-9045(89)90124-x"> <i class="sc">H.-J. Rack</i>, <i class="it">On polynomials with largest coefficient sums</i>, J. Approx. Theory <b class="bf">56</b> (1989), pp. 348-359. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rack17a">34</a></dt>
  <dd><p><a href ="https://doi.org/10.24193/subbmath.2017.2.02"> <i class="sc">H.-J. Rack</i>, <i class="it">The first Zolotarev case in the Erdős-Szegő solution to a Markov-type extremal problem of Schur</i>, Stud. Univ. Babes-Bolyai Math. <b class="bf">62</b> (2017), pp. 151-162. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rack17b">35</a></dt>
  <dd><p><a href ="https://ictp.acad.ro/jnaat/journal/article/view/1100"> <i class="sc">H.-J. Rack</i>, <i class="it">The second Zolotarev case in the Erdős-Szegő solution to a Markov- type extremal problem of Schur</i>, J. Numer. Anal. Approx. Theory <b class="bf">46</b> (2017), pp. 54-77. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rack18">36</a></dt>
  <dd><p><i class="sc">H.-J. Rack</i>, <i class="it">Explicit algebraic solution to Zolotarev’s First Problem for polynomials of degree \(n\in \{ 6,7,8\}  \)</i>, Abstract in: IX Jaén Conference on Approximation Theory (Úbeda, Spain, July 8-13, 2018). </p>
</dd>
  <dt><a name="Rack18b">37</a></dt>
  <dd><p><a href ="http://math.ubbcluj.ro/naat2018/abstracts"> <i class="sc">H.-J. Rack</i>, <i class="it">Abstract: Explicit algebraic solution to Zolotarev’s First Problem for polynomials of degree \(n\in \{ 6,7,8\}  \)</i>. In: IV International Conference on Numerical Analysis and Approximation Theory (Cluj-Napoca, Romania, September 6-9, 2018), <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="RackVajda19">38</a></dt>
  <dd><p><a href ="https://doi.org/10.14658/pupj-drna-2019-1-5"> <i class="sc">H.-J. Rack, R. Vajda</i>, <i class="it">An explicit univariate and radical parametrization of the sextic proper Zolotarev polynomials in power form</i>, Dolomites Res. Notes Approx. <b class="bf">12</b> (2019), pp. 43-50. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rivlin74">39</a></dt>
  <dd><p><a href ="https://doi.org/10.2307/2153227"> <i class="sc">Th.J. Rivlin</i>, <i class="it">Chebyshev Polynomials</i>, 2nd edition, J. Wiley &amp; Sons, New York (NY), USA, 1990. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Rivlin75">40</a></dt>
  <dd><p><a href ="https://doi.org/10.1137/0712053"> <i class="sc">Th.J. Rivlin</i>, <i class="it">Optimally stable Lagrangian numerical differentiation</i>, SIAM J. Numer. Anal. <b class="bf">12</b> (1975), pp. 712-725. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Schiefermayr07">41</a></dt>
  <dd><p><a href ="https://doi.org/10.1016/j.jat.2007.03.003"> <i class="sc">K. Schiefermayr</i>, <i class="it">Inverse polynomial images which consists of two Jordan arcs - An algebraic solution</i>, J. Approx. Theory <b class="bf">148</b> (2007), pp. 148-157. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Shadrin04">42</a></dt>
  <dd><p><a href ="http://www.damtp.cam.ac.uk/user/na/people/Alexei/papers/markov.pdf"> <i class="sc">A. Shadrin</i>, <i class="it">Twelve proofs of the Markov inequality</i>. In: Approximation Theory - A volume dedicated to B. Bojanov (D.K. Dimitrov et al. (Eds.)), M. Drinov Acad. Publ. House, Sofia, 2004, pp. 233-298. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Shadrin14">43</a></dt>
  <dd><p><a href ="https://doi.org/10.3934/dcds.2014.34.1183"> <i class="sc">A. Shadrin</i>, <i class="it">The Landau-Kolmogorov inequality revisited</i>, Discrete Contin. Dyn. Syst. <b class="bf">34</b> (2014), pp. 1183-1210. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Yuditskii93">44</a></dt>
  <dd><p><i class="sc">M.L. Sodin, P.M. Yuditskii</i>, <i class="it">Functions that deviate least from zero on closed subsets of the real axis</i>, St. Petersburg Math. J. <b class="bf">4</b> (1993), pp. 201-241. </p>
</dd>
  <dt><a name="Yuditskii95">45</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/bf02364906"> <i class="sc">M.L. Sodin, P.M. Yuditskii</i>, <i class="it">Algebraic solution of a problem of E.I. Zolotarev and N.I. Akhiezer on polynomials with smallest deviation from zero</i>, J. Math. Sci. <b class="bf">76</b> (1995), pp. 2486-2492. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Tikhomirov">46</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/978-3-642-61267-1_2"> <i class="sc">V.M. Tikhomirov</i>, <i class="it">II. Approximation Theory</i>. In: Analysis II (R.V. Gamkrelidze (Ed.)), Encyclopaedia of Mathematical Sciences, Vol. 14, Springer, New York (NY), USA, 1990, pp. 93-243 (Russian 1987). <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Todd84">47</a></dt>
  <dd><p><a href ="https://doi.org/10.1007/978-94-009-6466-2_11"> <i class="sc">J. Todd</i>, <i class="it">Applications of transformation theory: A legacy from Zolotarev (1847-1878)</i>, In: Approximation Theory and Spline Functions, Proceedings NATO Advanced Study Institute (ASIC 136, St. John’s, Canada, 1983, S.P. Singh et al. (Eds.)), 1984, pp. 207-245. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Vajda18">48</a></dt>
  <dd><p><a href ="http://math.ubbcluj.ro/naat2018/abstracts"> <i class="sc">R. Vajda</i>, <i class="it">Abstract: Explicit algebraic solution of the Zolotarev problem via Groebner basis</i>. In: IV International Conference on Numerical Analysis and Approximation Theory (Cluj-Napoca, Romania, September 6-9, 2018), <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="Voronovskaja70">49</a></dt>
  <dd><p><a href ="https://doi.org/10.1090/mmono/028"> <i class="sc">E.V. Voronovskaja</i>, <i class="it">The Functional Method and its Applications</i>, Translations of Mathematical Monographs, Vol. 28, AMS, Providence (RI), USA, 1970 (Russian version 1963).&#160;<img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="MMA1">50</a></dt>
  <dd><p><i class="sc">Wolfram Research, Inc.</i>, <i class="it">Mathematica</i>, Version 11.0, Champaign (IL), USA, 2016. </p>
</dd>
  <dt><a name="Zolotarev1868">51</a></dt>
  <dd><p><i class="sc">E.I. Zolotarev</i>, <i class="it">On a problem of least values, Dissertation pro venia legendi</i> (Russian), lithographed paper, St. Petersburg (1868), Collected Works, vol. 2, Leningrad 1932, pp. 130-166. </p>
</dd>
  <dt><a name="Zolotarev1877">52</a></dt>
  <dd><p><a href ="http://www.math.technion.ac.il/hat/fpapers/zolo1.pdf"> <i class="sc">E.I. Zolotarev</i>, <i class="it">Applications of elliptic functions to problems on functions deviating least or most from zero</i> (Russian), Zapiski Imper. Akad. Nauk St. Petersburg <b class="bf">30</b> (1877), Collected Works Vol. 2, Leningrad, 1932, pp. 1-59. <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
  <dt><a name="zfpr">53</a></dt>
  <dd><p><a href ="http://www.math.u-szeged.hu/~vajda/ZFP"><span class="tt">http://www.math.u-szeged.hu/\(\sim \)vajda/ZFP</span> <img src="img-0005.png" alt="\includegraphics[scale=0.1]{ext-link.png}" style="width:12.0px; height:10.700000000000001px" />
</a> </p>
</dd>
</dl>


</div>
</div> <!--main-text -->
</div> <!-- content-wrapper -->
</div> <!-- content -->
</div> <!-- wrapper -->

<nav class="prev_up_next">
</nav>

<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/jquery.min.js"></script>
<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/plastex.js"></script>
<script type="text/javascript" src="/var/www/clients/client1/web1/web/files/jnaat-files/journals/1/articles/js/svgxuse.js"></script>
</body>
</html>