Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-13T10:55:12.389Z Has data issue: false hasContentIssue false

INVERSE BERNSTEIN INEQUALITIES AND MIN–MAX–MIN PROBLEMS ON THE UNIT CIRCLE

Published online by Cambridge University Press:  13 August 2014

Tamás Erdélyi
Affiliation:
Department of Mathematics, Texas A&M University, College Station, TX 77843, U.S.A. email terdelyi@math.tamu.edu
Douglas P. Hardin
Affiliation:
Center for Constructive Approximation, Department of Mathematics, Vanderbilt University, Nashville, TN 37240, U.S.A. email doug.hardin@vanderbilt.edu
Edward B. Saff
Affiliation:
Center for Constructive Approximation, Department of Mathematics, Vanderbilt University, Nashville, TN 37240, U.S.A. email edward.b.saff@vanderbilt.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve a min–max–min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we show that this optimality also holds for a large class of potentials, including the Riesz potentials $1/r^{s}$ with $s>0.$

Information

Type
Research Article
Copyright
Copyright © University College London 2014