Monic integer Chebyshev problem

From MaRDI portal



Abstract: We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let denote the monic polynomials of degree n with integer coefficients. A {it monic integer Chebyshev polynomial} satisfies | M_n |_{E} = inf_{P_n in{M}_n ({�})} | P_n |_{E}. and the {it monic integer Chebyshev constant} is then defined by t_M(E) := lim_{n ightarrow infty} | M_n |_{E}^{1/n}. This is the obvious analogue of the more usual {it integer Chebyshev constant} that has been much studied. We compute tM(E) for various sets including all finite sets of rationals and make the following conjecture, which we prove in many cases. medskip oindent {�f Conjecture.} {it Suppose [a2/b2,a1/b1] is an interval whose endpoints are consecutive Farey fractions. This is characterized by a1b2−a2b1=1. Then} t_M[{a_2}/{b_2},{a_1}/{b_1}] = max(1/b_1,1/b_2). This should be contrasted with the non-monic integer Chebyshev constant case where the only intervals where the constant is exactly computed are intervals of length 4 or greater.


This is a nicely written paper, containing interesting results on the so called monic integer Chebyshev problem. Introducing the sup-norm on a compact set \(E\subset \mathbb{C}\) as usual \[ \| f\|_E:=\sup_{z\in E}\,| f(z)| , \] the authors define an integer Chebyshev polynomial \(Q_n\in{\mathbf P}_n(\mathbb{Z})\) by \[ | | Q_n| | _E=\inf_{0\not\equiv P_n\in{\mathbf P}_n (\mathbb{Z})}\,\| P_n\|_E, \] where the inf is taken over all non-trivial polynomials of degree at most \(n\) with integer coefficients. Then the integer Chebyshev constant (transfinite diameter) is defined by \[ t_{\mathbb{Z}}(E):=\lim_{n\rightarrow \infty}\,\| Q_n\|_E^{1/n}. \] Finally the same type of polynomials and quantities are introduced for monic integer Chebyshev polynomials \(M_n\) with exact degree \(n\): \[ \| M_n\|_E=\inf_{P_n\in{\mathbf M}_n (\mathbb{Z})}\,\| P_n\|_E, \] with monic integer Chebyshev constant \[ t_M(E):=\lim_{n\rightarrow \infty}\,\| Q_n\|_E^{1/n}. \] The following results are then given (and proved): 1. If \(E\) is \(\mathbb{R}\)-symmetric and \(\text{cap}(E)\geq 1\), then \(t_M(E)=\text{cap}(E)\). 2. Let \(E\subset\mathbb{C}\) be compact and \(\mathbb{R}\)-symmetric. If cap\((E)<1\), then \(t_M(E)<1\). 3. Let \(E\subset F\subset\mathbb{C}\), then \(t_M(E)<t_M(F)\). 4. Let \(E\) be compact. If \(P_n^{-1}(E)\) is the inverse image of \(E\) under a monic polynomial with integer coefficients of exact degree \(n\), then \(t_M(P_n^{-1}(E))=(t_M(E))^{1/n}\). 5. For integers \(n\geq 2\) the intervals \([0,1/n],[(n-1)/n,1],[-1/n,1/n]\) and \([0,1/n]\) all have \(T_M\)-value \(1/n\). 6. \(t_M([-1/\sqrt{n},1/\sqrt{n}]) = 1/\sqrt{n},\;n\geq 2\). 7. \(t_M([n,n+1/2])=t_M([n-1/2,n])= t_M([n,n+1])=t_M([0,1]) = t_M([0,1/2]) = \sqrt{t_M([0,1/4])}=1/2\). 8. \(t_M([n,n+2])=t_m([-1,1]) = \sqrt{t_M([0,1])}=1/\sqrt{2}\). 9. If \(E\subset [(1-\sqrt{2})/2,(1+\sqrt{2})/2]\) and \(1/2\in E\), then \(t_M(E) = t_M([(1-\sqrt{2})/2,(1+\sqrt{2})/2] = t_M(\{1/2\})=1/2\). Furthermore, they state results on finite sets of points: 10. \(t_M(\{m/n\})=1/n;\;m,n\in\mathbb{Z}\), \(n\geq 2\), \((m,n)=1\). 11. For \(E=\{a_1/b_1,\ldots,a_k/b_k\}\), with \(a_i/b_i\) rationals in their lowest terms, \(b_i>2\), there holds \(t_M(E)= \max_{1\leq i\leq k}\,1/b_i\). In the final section the authors consider intervals with endpoints being consecutive Farey fractions: \[ [a_2/b_2,a_1/b_1]\text{ with }a_1b_2-a_2b_1=1,\;a_i,b_j\in\mathbb{Z}. \] As a corollary from the results given before, it is known that \[ t_M([a_2/b_2,a_1/b_1])\geq \max\,(1/b_1,1/b_2). \] They conjecture that the inequality sign may be replaced by an equality sign and underpin this by a) the conjecture holds for intervals \([0,1/n]\) with \(n\geq 1\), b) explicit calculations for all Farey intervals with denominators less than \(22\).











This page was built for publication: Monic integer Chebyshev problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417167)