Monic integer Chebyshev problem
From MaRDI portal
Publication:4417167
DOI10.1090/S0025-5718-03-01477-7zbMath1054.11018arXiv1307.5362MaRDI QIDQ4417167
Igor E. Pritsker, Christopher G. Pinner, Peter B. Borwein
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
Polynomials in number theory (11C08) Polynomials and rational functions of one complex variable (30C10)
Related Items (8)
Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem ⋮ Generalized Gorshkov–Wirsing Polynomials and the Integer Chebyshev Problem ⋮ Polynomials with integer coefficients and their zeros ⋮ George Lorentz and inequalities in approximation ⋮ Chebyshev polynomials and integer coefficients ⋮ Heights of polynomials over lemniscates ⋮ The monic integer transfinite diameter ⋮ Small polynomials with integer coefficients
Cites Work
This page was built for publication: Monic integer Chebyshev problem