Abstract
The main problem of this chapter is to find a polynomial in <Emphasis FontCategory=“NonProportional”>Z</Emphasis> n of minimal supremum norm on an interval. This is P1, and it is of a slightly different flavour than most of the other problems in this book, in that there is no restriction on the size of the coefficients. We now state P1 with greater precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Selected References
P. Borwein and T. Erdélyi, The integer Chebyshev problem, Math. Comp. 65 (1996), 661–681.
P. Borwein, C. Pinner, and I. Pritsker, The monic integer Chebyshev problem, Math. Comp, (to appear).
V. Flammang, G. Rhin, and C.J. Smyth, The integer transfinite diameter of intervals and totally real algebraic integers, J. Théor. Nombres Bordeaux 9 (1997), 137–168.
L. Habsieger and B. Salvy, On integer Chebyshev polynomials, Math. Comp. 66 (1997), 763–770.
H.L. Montgomery, Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis, CBMS, Vol. 84, Amer. Math. Soc., Providence, RI, 1994.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Borwein, P. (2002). The Integer Chebyshev Problem. In: Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics / Ouvrages de mathématiques de la SMC. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21652-2_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-21652-2_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3000-2
Online ISBN: 978-0-387-21652-2
eBook Packages: Springer Book Archive