A note on Bernstein and Markov type inequalities (Q2569473)

Let \(\mathcal P_n\) denote the set of all polynomials of degree at most \(n\). By the well-known result of Duffin and Schaeffer, for every \(p\in\mathcal P_n\) one has \[ \| p^\prime\| _{[-1,1]}\leq n^2\max_{0\leq j\leq n}| p(\cos(j\pi/n)| , \] which is a discrete refinement of the famous Markov inequality \[ \| p^\prime\| _{[-1,1]}\leq n^2\| p\| _{[-1,1]}. \] \textit{C. Frappier, Q. I. Rahman} and \textit{St. Ruscheweyh} [Trans. Am. Math. Soc. 288, 69--99 (1985; Zbl 0567.30006)] showed that \[ \| p^\prime\| _{\mathbb D}\leq n\max_{0\leq j\leq 2n-1}\left| p\left(e^{ij\pi/n}\right)\right| , \] which in turn yields a similar extension of the classical Bernstein inequality \[ \| p^\prime\| _{\mathbb D}\leq n\| p\| _{\mathbb D}. \] In this paper, the authors prove a related result, viz. \[ \max_{| z| =1}\left| \frac{p(z)-p(\bar z)}{z-\bar z}\right| \leq \max_{0\leq j\leq n}\left| \frac{p\left(e^{ij\pi/n}\right)+p\left(e^{-ij\pi/n}\right)}{2}\right| , \] which also furnishes an inequality in the spirit of that given by Frappier et al.