Monic integer Chebyshev problem

DOI10.1090/S0025-5718-03-01477-7MaRDI QIDQ4417167zbMATH OpenFDO

Authors Peter Borwein, Chris Pinner, Igor E. Pritsker

Publication date 28 July 2003

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.5362

zbMATH Keywords

Chebyshev polynomialsinteger transfinite diameterinteger Chebyshev constant

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials and rational functions of one complex variable (30C10)

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 ${\displaystyle }$ | M_n |_{E} = inf_{P_n in{M}_n ({�})} | P_n |_{E}. ${\displaystyle }$ and the {it monic integer Chebyshev constant} is then defined by ${\displaystyle }$ t_M(E) := lim_{n ightarrow infty} | M_n |_{E}^{1/n}. ${\displaystyle }$ This is the obvious analogue of the more usual {it integer Chebyshev constant} that has been much studied. We compute $t_M(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 $[a_2/b_2,a_1/b_1]$ is an interval whose endpoints are consecutive Farey fractions. This is characterized by $a_1{b}_2-a_2{b}_1=1.$ Then} ${\displaystyle }$t_M[{a_2}/{b_2},{a_1}/{b_1}] = max(1/b_1,1/b_2).${\displaystyle }$ 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.

Recommendations

• The monic integer transfinite diameter
• The integer Chebyshev constant of Farey intervals
• Small polynomials with integer coefficients
• Chebyshev polynomials with integer coefficients
• On integer Chebyshev polynomials

Cites work

• scientific article; zbMATH DE number 3871473 (Why is no real title available?)
• scientific article; zbMATH DE number 3687942 (Why is no real title available?)
• scientific article; zbMATH DE number 48688 (Why is no real title available?)
• scientific article; zbMATH DE number 3503564 (Why is no real title available?)
• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• scientific article; zbMATH DE number 739279 (Why is no real title available?)
• scientific article; zbMATH DE number 826245 (Why is no real title available?)
• scientific article; zbMATH DE number 3291298 (Why is no real title available?)
• On integer Chebyshev polynomials
• Small polynomials with integer coefficients
• The integer Chebyshev problem
• The integer transfinite diameter of intervals and totally real algebraic integers

Cited in

(16)

• Polynomials with integer coefficients and their zeros
• The multivariate integer Chebyshev problem
• Remembering Peter Benjamin Borwein (May 10, 1953 -- August 23, 2020)
• On monic irreducible integer polynomials close to a complex monic polynomial
• Small polynomials with integer coefficients
• Chebyshev polynomials and integer coefficients
• Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem
• Consequences of the continuity of the monic integer transfinite diameter
• The monic integer transfinite diameter
• George Lorentz and inequalities in approximation
• A new exceptional polynomial for the integer transfinite diameter of \([0,1]\)
• The integer Chebyshev constant of Farey intervals
• Heights of polynomials over lemniscates
• Chebyshev constants and the inheritance problem
• Best approximation of constants by polynomials with integer coefficients
• Generalized Gorshkov-Wirsing polynomials and the integer Chebyshev problem

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)