Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

Proof of a conjecture of Erdős about the longest polynomial


Author: B. D. Bojanov
Journal: Proc. Amer. Math. Soc. 84 (1982), 99-103
MSC: Primary 41A17
DOI: https://doi.org/10.1090/S0002-9939-1982-0633287-X
Addendum: Proc. Amer. Math. Soc. 89 (1983), 188.
MathSciNet review: 633287
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In 1939 P. Erdös conjectured that the Chebyshev polynomial $ {T_n}(x)$ has a maximal arc-length in $ [ - 1,1]$ among the polynomials of degree $ n$ which are bounded by 1 in $ [ - 1,1]$. We prove this conjecture for every natural $ n$.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 41A17

Retrieve articles in all journals with MSC: 41A17


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1982-0633287-X
Keywords: Arc-length, Chebyshev polynomial, extremal problem for polynomials
Article copyright: © Copyright 1982 American Mathematical Society