相关论文: Weak log majorization and determinantal inequaliti…

In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.

In this paper, we show the central limit theorem for the logarithmic determinant of the sample correlation matrix $\mathbf{R}$ constructed from the $(p\times n)$-dimensional data matrix $\mathbf{X}$ containing independent and identically…

In information theory, the well-known log-sum inequality is a fundamental tool which indicates the non-negativity for the relative entropy. In this article, we establish a set of inequalities which are similar to the log-sum inequality…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

We prove majorization inequalities for different means of positive definite matrices. These include the Cartan mean (the Karcher mean), the log Euclidean mean, the Wasserstein mean and the power mean.

Let $\overline{p}(n)$ denote the overpartition funtion. This paper presents the $2$-$\log$-concavity property of $\overline{p}(n)$ by considering a more general inequality of the following form \begin{equation*} \begin{vmatrix}…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}\Delta^r \log \p(n)$, by…

We prove inequalities on symmetric tensor sums of positive definite operators. In particular, we prove multivariable operator inequalities inspired by generalizations to the well-known Hlawka and Popoviciu inequalities. As corollaries, we…

We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…

Let $(g_{n})_{n\geq 1}$ be a sequence of independent identically distributed $d\times d$ real random matrices with Lyapunov exponent $\gamma$. For any starting point $x$ on the unit sphere in $\mathbb R^d$, we deal with the norm $ | G_n x |…

When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…

If $c_1(Z) \geq ... \geq c_n(Z)$ denote the Euclidean lengths of the column vectors of any $n \times n$ matrix $Z,$ then a fundamental inequality related to Hadamard products states that $$ \sum_{i=1}^k \sigma_i(X^*Y \circ B) \leq…

Evaluating the log determinant of a positive definite matrix is ubiquitous in machine learning. Applications thereof range from Gaussian processes, minimum-volume ellipsoids, metric learning, kernel learning, Bayesian neural networks,…

For positive semi-definite block-matrix $M,$ we say that $M$ is P.S.D. and we write $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix} \in {\mathbb{M}}\_{n+m}^+$, with $A\in {\mathbb{M}}\_n^+$, $B \in {\mathbb{M}}\_m^+.$ The focus is on…

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…

Let $\{w_{i,j}\}_{1\leq i\leq n, 1\leq j\leq s} \subset L_m=F(X_1,...,X_m)[{\partial \over \partial X_1},..., {\partial \over \partial X_m}]$ be linear partial differential operators of orders with respect to ${\partial \over \partial…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Hadamard's determinant inequality was refined and generalized by Zhang and Yang in [Acta Math. Appl. Sinica 20 (1997) 269-274]. Some special cases of the result were rediscovered recently by Rozanski, Witula and Hetmaniok in [Linear Algebra…