Search Results for ""

If p_1, ..., p_n are positive numbers which sum to 1 and f is a real continuous function that is convex, then f(sum_(i=1)^np_ix_i)<=sum_(i=1)^np_if(x_i). (1) If f is concave, ...

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.

Let P be a polynomial of degree n with derivative P^'. Then ||P^'||_infty<=n||P||_infty, where ||P||_infty=max_(|z|=1)|P(z)|.

If a distribution has a single mode at mu_0, then P(|x-mu_0|>=lambdatau)<=4/(9lambda^2), where tau^2=sigma^2+(mu-mu_0)^2.

If B superset A (B is a superset of A), then P(A)<=P(B).

If the fourth moment mu_4!=0, then P(|x^_-mu_4|>=lambda)<=(mu_4+3(N-1)sigma^4)/(N^3lambda^4), where sigma^2 is the variance.

If 0<=g(x)<=1 and g is nonincreasing on the interval [0, 1], then for all possible values of a and b, int_0^1g(x^(1/(a+b)))dx>=int_0^1g(x^(1/a))dxint_0^1g(x^(1/b))dx.

For homogeneous polynomials P and Q of degree m and n, then sqrt((m!n!)/((m+n)!))[P]_2[Q]_2<=[P·Q]_2<=[P]_2[Q]_2, where [P·Q]_2 is the Bombieri norm.

Gives a lower bound for the inner product (Lu,u), where L is a linear elliptic real differential operator of order m, and u has compact support.