Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 149 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 112 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Some Sharpening and Generalizations of a result of T. J. Rivlin (1701.04161v1)

Published 16 Jan 2017 in math.CV

Abstract: Let $p(z)=a_0+a_1z+a_2z2+a_3z3+\cdots+a_nzn$ be a polynomial of degree $n$. Rivlin \cite{Rivlin} proved that if $p(z)\neq 0$ in the unit disk, then for $0<r\leq 1$, $\displaystyle{\max_{|z| = r}|p(z)|} \geq \Big(\dfrac{r+1}{2}\Big)n \displaystyle{\max_{|z|=1} |p(z)|}.$ ~In this paper, we prove a sharpening and generalization of this result, and show by means of examples that for some polynomials our result can significantly improve the bound obtained by the Rivlin's Theorem.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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