Lower bound for the discrete norm of a polynomial on the circle (Q764043)

This article is concerned with an estimate for the uniform norm (of a polynomial on the unit circle), given values on a discrete subset (roots of unity). The bound is of the form \[ \max_{\omega^N=1}|P(\omega)|\geq C(n,N) \max_{|z|=1}|P(z)| \] with \(P\) being a polynomial of degree \(n<N\). In this note the bound is proved to hold for \(C(n,N)=\cos({n\pi\over 2N})\). Compared with the estimate \(C(n,N)=\sqrt{{N-n\over N}}\) given in [\textit{T.\ Sheil-Small}, Bull.\ Lond.\ Math.\ Soc.\ 40, No.\ 6, 956--964 (2008; Zbl 1163.30011)] it is weaker in the case \(n<N<2n\), both bounds coincide when \(N=2n\), and it is stronger for \(N>2n\). The proof is based on the maximum modulus principle for a particular holomorphic function. Note also the result of \textit{E.\ Rakhmanov} and \textit{B.\ Shekhtman} in [J. Approximation Theory 139, No. 1--2, 2--7 (2006; Zbl 1094.41010)] where \(C(n,N)=\left(1+C\log{N\over N-n}\right)^{-1}\), which is best for \(n/N\approx 1\).