Related papers: On a Certain Function with Negative Coefficients
Sharp affine Hardy--Littlewood--Sobolev inequalities for functions on $\mathbb R^n$ are established, which are significantly stronger than (and directly imply) the sharp Hardy--Littlewood--Sobolev inequalities by Lieb and by Beckner, Dou,…
We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…
In this note we consider inequalities involving the error function $\phi$. Our methodes give new proofs of some known inequalities of Komatsu, and of Szarek and Werner, and also produce two families of inequalities that give upper and lower…
New proofs of the classical Hermite-Hadamard inequality are presented and several applications are given, including Hadamard-type inequalities for the functions, whose derivatives have inflection points or whose derivatives are convex.…
We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…
This a very brief account of the main line of development of Hardy inequalities.
Following Eden and Foias we obtain a matrix version of a generalised Sobolev inequality in one-dimension. This allow us to improve on the known estimates of best constants in Lieb-Thirring inequalities for the sum of the negative…
For the functions $f$, which can be represented in the form of the convolution $f(x)=\frac{a_{0}}{2}+\frac{1}{\pi}\int\limits_{-\pi}^{\pi}\sum\limits_{k=1}^{\infty}e^{-\alpha k^{r}}\cos(kt-\frac{\beta\pi}{2})\varphi(x-t)dt$,…
Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is…
We prove two inequalities for the Mittag-Leffler function, namely that the function $\log E_\alpha(x^\alpha)$ is sub-additive for $0<\alpha<1,$ and super-additive for $\alpha>1.$ These assertions follow from two new binomial inequalities,…
We give variations on Ando's result comparing $f(B)-f(A)$ and $f(|B-A|)$ with respect to unitarily invariant norms on matrices.
A new determinant inequality of positive semidefinite matrices is discovered and proved by us. This new inequality is useful for attacking and solving a variety of optimization problems arising from the design of wireless communication…
In this article we consider a method of proving a class of inequalities of the form (1). The method is based on the precise approximations of the sine and cosine functions by Maclaurin polynomials of given order. By using this method we…
This article improves the triangle inequality for complex numbers, using the Hermite-Hadamard inequality for convex functions. Then, applications of the obtained refinement are presented to include some operator inequalities. The operator…
In 1955, A.~Grothendieck proved a basic inequality which shows that any bounded linear operator between $L^1(\mu)$-spaces maps (Lebesgue-) dominated sequences to dominated sequences. An elementary proof of this inequality is obtained via a…
We shall generalize the concept of $z=(1-t)x\oplus ty$ to $n$ times which contains to verifying some their properties and inequalities in CAT(0) spaces. In the sequel with introducing of $\alpha$-nonexpansive mappings, we obtain some fixed…
In this short note, we give the refined Young inequality with Specht's ratio by only elementary and direct calculations. The obtained inequality is better than one previously shown by the author in 2012. In addition, we give a new property…
In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.
In this note we aim at putting more emphasis on the fact that trying to solve non-convex optimization problems with coordinate-descent iterative linear matrix inequality algorithms leads to suboptimal solutions, and put forward other…
We improve and generalize some operator inequalities for positive linear maps. It is shown, among other inequalities, that if $0<m\le B\le m'<M'\le A\le M$ or $0<m\le A\le m'<M'\le B\le M$, then for each $2\le p<\infty $ and $\nu \in \left[…