summary:Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequality $\|p'\|_{[-1,1]}\leq \frac 12\|p\|_{[-1,1]}$ for a constrained polynomial $p$ of degree at most $n$, initially claimed by P. Erd\H os, which is different from the one in the paper of T. Erdélyi (2015). Whereafter, we give the situations on which the equality holds. On the basis of this inequality, we study the monotone polynomial which has only real zeros all but one outside of the interval $(-1,1)$ and establish a new asymptotically sharp inequality
The following problem, suggested by Laguerre’s Theorem (1884), remains open: Characterize all real s...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...
summary:Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequ...
The Erdős–Lax Theorem states that if $P(z)=\sum _{\nu =1}^n a_{\nu }z^{\nu }$ is a polynomial of deg...
AbstractIf p(z) is a polynomial of degree at most n having no zeros in ¦z¦ < 1, then according to a ...
Let $p(z)$ be a polynomial of degree $n$ having no zero in $|z|< k$, $k\leq 1$, then Govil [Proc. Na...
AbstractLet pn(z) = an Πv = 1n (z − zv), an ≠ 0 be a polynomial of degree n and let ∥pn∥ = max¦z¦ = ...
We point out certain flaws in two papers published in Ann. Univ. Mariae Curie-Skłodowska Sect. A, on...
summary:Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequ...
AbstractLet p(z) = ∑v = 0navzv be a polynomial of degree n having no zeros in ¦z¦ < k, k ⩾ 1. Then w...
This paper deals with the problem of finding some upper bound estimates for the maximum modulus of t...
AbstractMarkov's inequality asserts that max−1⩽x⩽1|p′(x)|⩽n2max−1⩽x⩽1|p(x)| (1) for every polynomial...
summary:Let $P(z)=\sum _{\nu =0}^{n}a_{\nu }z^{\nu }$ be a polynomial of degree at most $n$ which do...
summary:Let $P(z)=\sum _{\nu =0}^{n}a_{\nu }z^{\nu }$ be a polynomial of degree at most $n$ which do...
The following problem, suggested by Laguerre’s Theorem (1884), remains open: Characterize all real s...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...
summary:Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequ...
The Erdős–Lax Theorem states that if $P(z)=\sum _{\nu =1}^n a_{\nu }z^{\nu }$ is a polynomial of deg...
AbstractIf p(z) is a polynomial of degree at most n having no zeros in ¦z¦ < 1, then according to a ...
Let $p(z)$ be a polynomial of degree $n$ having no zero in $|z|< k$, $k\leq 1$, then Govil [Proc. Na...
AbstractLet pn(z) = an Πv = 1n (z − zv), an ≠ 0 be a polynomial of degree n and let ∥pn∥ = max¦z¦ = ...
We point out certain flaws in two papers published in Ann. Univ. Mariae Curie-Skłodowska Sect. A, on...
summary:Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequ...
AbstractLet p(z) = ∑v = 0navzv be a polynomial of degree n having no zeros in ¦z¦ < k, k ⩾ 1. Then w...
This paper deals with the problem of finding some upper bound estimates for the maximum modulus of t...
AbstractMarkov's inequality asserts that max−1⩽x⩽1|p′(x)|⩽n2max−1⩽x⩽1|p(x)| (1) for every polynomial...
summary:Let $P(z)=\sum _{\nu =0}^{n}a_{\nu }z^{\nu }$ be a polynomial of degree at most $n$ which do...
summary:Let $P(z)=\sum _{\nu =0}^{n}a_{\nu }z^{\nu }$ be a polynomial of degree at most $n$ which do...
The following problem, suggested by Laguerre’s Theorem (1884), remains open: Characterize all real s...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...
Let $P_m$ be a class of all polynomials of degree at most m and let $R_{m,n}=R_{m,n}(d_{1}, ..., d_{...