Papers
Topics
Authors
Recent
Search
2000 character limit reached

Random Bernstein-Markov factors

Published 23 Oct 2018 in math.CV, math.CA, and math.PR | (1810.09931v1)

Abstract: For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $|P_n'| \le n |P_n|$ for all $Lp$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c zn.$ We study this inequality for random polynomials, and show that the expected (average) and almost sure value of $\Vert P_n' \Vert/\Vert P_n\Vert$ is often different from the classical deterministic upper bound $n$. In particular, for circles of radii less than one, the ratio $\Vert P_n' \Vert/\Vert P_n\Vert$ is almost surely bounded as $n$ tends to infinity, and its expected value is uniformly bounded for all degrees under mild assumptions on the random coefficients. For norms on the unit circle, Borwein and Lockhart mentioned that the asymptotic value of $\Vert P_n' \Vert/\Vert P_n\Vert$ in probability is $n/\sqrt{3},$ and we strengthen this to almost sure limit for $p=2.$ If the radius $R$ of the circle is larger than one, then the asymptotic value of $\Vert P_n' \Vert/\Vert P_n\Vert$ in probability is $n/R$, matching the sharp upper bound for the deterministic case. We also obtain bounds for the case $p=\infty$ on the unit circle.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.