Muirhead inequality for convex orders and a problem of I. Ra\c{s}a on Bernstein polynomials
Abstract
We present a new, very short proof of a conjecture by I. Ra\c{s}a, which is an inequality involving basic Bernstein polynomials and convex functions. It was affirmed positively very recently by J. Mrowiec, T. Rajba and S. W\k{a}sowicz (2017) by the use of stochastic convex orders, as well as by Abel (2017) who simplified their proof. We give a useful sufficient condition for the verification of some stochastic convex order relations, which in the case of binomial distributions are equivalent to the I. Ra\c{s}a inequality. We give also the corresponding inequalities for other distributions. Our methods allow us to give some extended versions of stochastic convex orderings as well as the I. Ra\c{s}a type inequalities. In particular, we prove the Muirhead type inequality for convex orders for convolution polynomials of probability distributions.
Keywords
Cite
@article{arxiv.1703.10634,
title = {Muirhead inequality for convex orders and a problem of I. Ra\c{s}a on Bernstein polynomials},
author = {Andrzej Komisarski and Teresa Rajba},
journal= {arXiv preprint arXiv:1703.10634},
year = {2017}
}