Related papers: Bounds of the logarithmic mean
Motivated by the refinements and reverses of arithmetic-geometric mean and arithmetic-harmonic mean inequalities for scalars and matrices, in this article, we generalize the scalar and matrix inequalities for the difference between…
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…
We consider the problem of low rank matrix recovery in a stochastically noisy high dimensional setting. We propose a new estimator for the low rank matrix, based on the iterative hard thresholding method, and that is computationally…
We establish multilinear $L^p$ bounds for a class of maximal multilinear averages of functions on one variable, reproving and generalizing the bilinear maximal function bounds of Lacey. As an application we obtain almost everywhere…
We establish the Caffarelli-Kohn-Nirenberg type inequalities involving{ super-logarithms (infinitely iterated logarithms).} As a result the critical Caffarelli-Kohn-Nirenberg type inequalities will be improved, and in certain cases the best…
For operators defined on locally convex spaces we define the notions of boundedness and ergodicity associated to an infinite matrix. Given two matrices $ A$ and $ B$, we study when $ A$-bounded operators are $ B$-ergodic. Using this…
We give tight upper bounds on the numerical range of square matrices in terms of their Frobenius (Euclidian) norm and a combinatorial parameter similar to the clique number of graphs. Our results imply a concise form of the fundamental…
We develop a class of minimax estimators for a normal mean matrix under the Frobenius loss, which generalizes the James--Stein and Efron--Morris estimators. It shrinks the Schatten norm towards zero and works well for low-rank matrices. We…
We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We present upper and lower bounds for the numerical radius of $2 \times 2$ operator matrices which improves on the existing bound for the same. As an application of the results obtained we give a better estimation for the zeros of a…
We show that an almost trivial inequality for the first and second mean of a random variable can be used to give non-trivial improvements on deep results. As applications we improve on results on lower bounds for the Riemann zeta-function…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
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…
We will consider about some inequalities on operator means for more than three operators, for instance, ALM and BMP geometric means will be considered. Moreover, log-Euclidean and logarithmic means for several operators will be treated.
We derive some inequalities involving first four central moments of discrete and continuous distributions. Bounds for the eigenvalues and spread of a matrix are obtained when all its eigenvalues are real. Likewise, we discuss bounds for the…
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…
Relating to finding possible upper bounds for the probability of error for discriminating between two quantum states, it is well-known that \begin{align*} \mathrm{tr}(A+B) - \mathrm{tr}|A-B|\leq 2\, \mathrm{tr}\big(f(A)g(B)\big)…
Motivated by the work of Anderson, Vamanamurthy and Vuorinen \cite{avv}, in this paper authors study the log-convexity and log-concavity of Power mean, Identric mean, weighted Power mean, Lehmer mean, Modified Alzer mean, and establish the…
We characterize the finite sets S of words such that that the iterated shuffle of S is co-finite and we give some bounds on the length of a longest word not in the iterated shuffle of S.