pith. sign in

arxiv: 1801.02247 · v1 · pith:R4FVZUCFnew · submitted 2018-01-07 · 🧮 math.CA

A sharpening of a problem on Bernstein polynomials and convex function and related results

classification 🧮 math.CA
keywords convexinequalityproofsomebernsteingiveninequalitiespolynomials
0
0 comments X
read the original abstract

We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof allow us to obtain some extended versions of this inequality as well as other inequalities given by I. Ra\c{s}a. As a tool we use stochastic convex ordering relations. We propose also some generalizations of the binomial convex concentration inequality. We use it to insert some additional expressions between left and right sides of the Ra\c{s}a inequalities.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.