Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Turán-type reverse Markov inequalities for polynomials with restricted zeros (1909.10118v1)

Published 23 Sep 2019 in math.CA

Abstract: Let ${\cal P}nc$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D+ := {z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0}$$ be the closed upper half-disk of the complex plane. For integers $0 \leq k \leq n$ let ${\mathcal F}{n,k}c$ be the set of all polynomials $P \in {\mathcal P}nc$ having at least $n-k$ zeros in $D+$. Let $$|f|_A := \sup{z \in A}{|f(z)|}$$ for complex-valued functions defined on $A \subset {\Bbb C}$. We prove that there are absolute constants $c_1 > 0$ and $c_2 > 0$ such that $$c_1 \left(\frac{n}{k+1}\right){1/2} \leq \inf_{P}{\frac{|P{\prime}|{[-1,1]}}{|P|{[-1,1]}}} \leq c_2 \left(\frac{n}{k+1}\right){1/2}$$ for all integers $0 \leq k \leq n$, where the infimum is taken for all $0 \not\equiv P \in {\mathcal F}{n,k}c$ having at least one zero in $[-1,1]$. This is an essentially sharp reverse Markov-type inequality for the classes ${\mathcal F}{n,k}c$ extending earlier results of Tur\'an and Komarov from the case $k=0$ to the cases $0 \leq k \leq n$.

Summary

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