Some inequalities for combinatorial matrix functions

Some Inequalities for Reliability Functions

On some matrix inequalities

The arithmetic-geometric mean inequality for singular values due to Bhatia and Kittaneh says that 2sj(AB ∗) ≤ sj(A∗A + B∗B), j = 1, 2, . . . for any matrices A,B. We first give new proofs of this inequality and its equivalent form. Then we use it to prove the following trace inequality: Let A0 be a positive definite matrix and A1, . . . , Ak be positive semidefinite matrices. Then tr k ∑

Some Matrix Rearrangement Inequalities

We investigate a rearrangement inequality for pairs of n × n matrices: Let ‖A‖p denote (Tr(A∗A)p/2)1/p, the C trace norm of an n×n matrix A. Consider the quantity ‖A+B‖p+‖A−B‖p. Under certain positivity conditions, we show that this is nonincreasing for a natural “rearrangement” of the matrices A and B when 1 ≤ p ≤ 2. We conjecture that this is true in general, without any restrictions on A and...

Sufficient Inequalities for Univalent Functions

In this work, applying Lemma due to Nunokawa et. al. cite{NCKS}, we obtain some sufficient inequalities for some certain subclasses of univalent functions.

New integral inequalities for $s$-preinvex functions

In this note, we give some estimate of the generalized quadrature formula of Gauss-Jacobi$$underset{a}{overset{a+eta left( b,aright) }{int }}left( x-aright)^{p}left( a+eta left( b,aright) -xright) ^{q}fleft( xright) dx$$in the cases where $f$ and $left| fright| ^{lambda }$ for $lambda >1$, are $s$-preinvex functions in the second sense.