On the Smirnov-Type Inequality for Polynomials

Mathematical Notes - The presented article is devoted to differential inequalities for polynomials. The theme goes back to the problem posed by the famous chemist D. I. Mendeleev. This problem was...     

多项式及其导数不等式

设‖·‖是 ( -∞ ,+∞ )上关于权 e- t2 的 L2范数 ,本文证明了对一切次数不超过 n的多项式f ( x) ,有‖ f′‖2 ≤ A‖ f″‖ 2 +( 2 n-4An( n-1 ) )‖ f‖ 2 ,这里 A只要满足 A≤ 14( n-1 ) .     

A Sharp Remez Inequality for Trigonometric Polynomials

We obtain a sharp Remez inequality for the trigonometric polynomial T _n of degree n on [0,2π): $$\|T_n \|_{L_\infty([0,2\pi))} \le \biggl(1+2\tan^2 \frac{n\beta}{4m} \biggr) { \|T_n \|_{L_\infty ([0,2\pi) \setminus B )}}, $$ where $\frac{2\pi}{m}$ is the minimal period of T _n and $|B|=\beta<\frac {2\pi m}{n}$ is a measurable subset of $\mathbb {T}$ . In particular, this gives the asymptotics of the sharp constant in the Remez inequality: for a fixed n, $$\mathcal{C}(n, \beta)=1+ \frac{(n\beta)^2}{8} +O \bigl(\beta^4\bigr), \quad\beta \to0, $$ where $$\mathcal{C}(n,\beta):= \sup_{|B|=\beta}\sup_{T_n} \frac{ \|T_n \|_{L_\infty([0,2\pi ))}}{ \|T_n \|_{L_\infty ([0,2\pi) \setminus B )}}. $$ We also obtain sharp Nikol’skii’s inequalities for the Lorentz spaces and net spaces. Multidimensional variants of Remez and Nikol’skii’s inequalities are investigated.     

A Note on a Remez-Type Inequality for Trigonometric Polynomials

We obtain sharp bounds, in the uniform norm along the unit circle , of exponentials of logarithmic potentials, if the logarithmic capacity of the subset of , where they are at most 1, is known.     

关于Shafer-Fink不等式和Carlson不等式

改进了Shafer-Fink不等式的上界,并给出了Carlson不等式的一个上界估计.     

A Sharp Version of Mahler's Inequality for Products of Polynomials

In this note we give some sharp estimates for norms of polynomialsvia the products of norms of their linear terms. Different convexnorms on the unit disc are considered. 1991 Mathematics SubjectClassification 30C10, 11C08.     

Theorems of the Alternative for Inequality Systems of Real Polynomials

In this paper, we establish theorems of the alternative for inequality systems of real polynomials. For the real quadratic inequality system, we present two new results on the matrix decomposition, by which we establish two theorems of the alternative for the inequality system of three quadratic polynomials under an assumption that at least one of the involved forms be negative semidefinite. We also extend a theorem of the alternative to the case with a regular cone. For the inequality system of higher degree real polynomials, defined by even order tensors, a theorem of the alternative for the inequality system of two higher degree polynomials is established under suitable assumptions. As a byproduct, we give an equivalence result between two statements involving two higher degree polynomials. Based on this result, we investigate the optimality condition of a class of polynomial optimization problems under suitable assumptions.     

A Markov-Type Inequality for Multivariate Polynomials on a Convex Body

A Markov-type inequality for the k-homogeneous part of a multivariate polynomial on a convex centrally symmetric body is given and an extremal polynomial is found. This generalizes and extends some estimates for univariate and multivariate polynomials obtained by Markov, Bernstein, Visser, Reimer, and Rack.     

多元Bernstein多项式加权逼近的Steckin-Marchaud型不等式

引进一种新的光滑模,建立多元Ｂｅｒｎｓｔｅｉｎ多项式加权逼近的Ｓｔｅｃｋｉｎ Ｍａｒｃｈａｕｄ型不等式．     

On Octonionic Polynomials

We discuss the generalization of results on quaternionic polynomials to the octonionic polynomials. In contrast to the quaternions the octonionic multiplication is non-associative. This fact although introducing some difficulties nevertheless leads to some new results. For instance, the monic and non-monic polynomials do not have, in general, the same set of zeros. Concerning the zeros, it is shown that in the monic and non-monic cases they are not the same, in general, but they belong to the same set of conjugacy classes. Despite these difficulties created by the non-associativity, we obtain equivalent results to the quaternionic case with respect to the number of zeros and the procedure to compute them.     

On Bernstein's inequality for entire functions of exponential type

It was shown by S.N. Bernstein that if f is an entire function of exponential type τ such that |f(x)|?M for −∞<x<∞, then |f^′(x)|?Mτ for −∞<x<∞. If p is a polynomial of degree at most n with |p(z)|?M for |z|=1, then f(z):=p(eiz) is an entire function of exponential type n with |f(x)|?M on the real axis. Hence, by the just mentioned inequality for functions of exponential type, |p^′(z)|?Mn for |z|=1. Lately, many papers have been written on polynomials p that satisfy the condition znp(1/z)≡p(z). They do form an intriguing class. If a polynomial p satisfies this condition, then f(z):=p(eiz) is an entire function of exponential type n that satisfies the condition f(z)≡einzf(−z). This led Govil [N.K. Govil, Lp inequalities for entire functions of exponential type, Math. Inequal. Appl. 6 (2003) 445-452] to consider entire functions f of exponential type satisfying f(z)≡eiτzf(−z) and find estimates for their derivatives. In the present paper we present some additional observations about such functions.     

Heinz's inequality and Bernstein's inequality

The purpose of the present account is to sharpen Heinz's inequality, and to investigate the equality and the bound of the inequality. As a consequence of this we present a Bernstein type inequality for nonselfadjoint operators. The Heinz inequality can be naturally extended to a more general case, and from which we obtain in particular Bessel's equality and inequality. Finally, Bernstein's inequality is extended to eigenvectors, and shows that the bound of the inequality is preserved.

     

On Integer Chebyshev Polynomials

We are concerned with the problem of minimizing the supremum norm on of a nonzero polynomial of degree at most with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and improve a lower bound due to Flammang et al.