scientific article; zbMATH DE number 2218525

Publication date 26 October 2005

Full work available at URL https://eudml.org/doc/126194

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

inequalities numerical shift operator palindromic polynomials

Special polynomials in general fields (12E10) Convexity of real functions in one variable, generalizations (26A51) Inequalities for sums, series and integrals (26D15)

Review text

The author uses some properties possessed by the polynomial on the left side of \[ \sum^ n_ 0 \Big[\frac1{n+1}-\frac1{2^ n}\Big(\begin{matrix} n\\k\end{matrix}\Big)\Big]x^ k \geq 0\tag{1} \] which allow the sequence results in \[ \sum^ n_ 0 \Big[\frac1{n+1}-\frac1{2^ n}\Big(\begin{matrix} n \\ k\end{matrix}\Big)\Big]u_ k \geq 0 \tag{2} \] to be deduced directly from the polynomial itself. Specifically, the following result is obtained. Assume that the polynomial \(\sum^ n_ 0 a_ k x^ k\) has \(x=1\) as a double root with \[ b_ k = \sum^ k_{j= 0} a_ j \quad (k=0, \ldots, n-1) \] and \[ c_ k = \sum^ k_{j= 0} b_ j \quad (k=0, \ldots, n-2), \] where the \(c_ k\) are nonnegative, then the sequence inequality \[ \sum^ n_ 0 a_ k u_ k \geq 0 \] holds, where the sequence \(\left\{u_ k\right\}\) is convex. Examples to demonstrate that the above result gives the sequence inequality, not from the polynomial inequality, but from the properties of the polynomial itself are given. The above result generalizes the previous work of \textit{S. Haber} [Internat. J. Math. Math. Sci. 2, 531--535 (1979; Zbl 0416.26011)] and \textit{A. McD Mercer} [Inter. J. Math. Math. Sci. 6, 609--611 (1983; Zbl 0535.26008)].

Cited in

(15)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5699796)