Related papers: Weak log majorization and determinantal inequaliti…

We prove a weak version of the $\varepsilon$-Dvoretzky conjecture for normed spaces, showing the existence of a subspace of $\mathbb{R}^n$ of dimension at least $c \log n / |\log \varepsilon|$ in which the given norm is $\varepsilon$-close…

Computing $\log\det(A)$ for large symmetric positive definite matrices arises in Gaussian process inference and Bayesian model comparison. Standard methods combine matrix-vector products with polynomial approximations. We study a different…

In this paper, we generalize some matrix inequalities involving matrix power and Karcher means of positive definite matrices. Among other inequalities, it is shown that if ${\mathbb A}=(A_{1},...,A_{n})$ is a $n$-tuple of positive definite…

We prove a general result on equality of the weak limits of the zero counting measure, $d\nu_n$, of orthogonal polynomials (defined by a measure $d\mu$) and $\frac{1}{n} K_n(x,x) d\mu(x)$. By combining this with Mate--Nevai and Totik upper…

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…

A composite positive integer $n$ is said to be a {\it weak Carmichael number} if $$ \sum_{\gcd(k,n)=1\atop 1\le k\le n-1}k^{n-1}\equiv \varphi(n) \pmod{n}. \leqno(1) $$ It is proved that a composite positive integer $n$ is a weak Carmichael…

This paper studies the principal components (PC) estimator for high dimensional approximate factor models with weak factors in that the factor loading ($\boldsymbol{\Lambda}^0$) scales sublinearly in the number $N$ of cross-section units,…

We establish a central limit theorem for the log-determinant $\log|\det(M_n)|$ of a Wigner matrix $M_n$, under the assumption of four matching moments with either the GUE or GOE ensemble. More specifically, we show that this log-determinant…

We consider the problem of decomposing a large covariance matrix into the sum of a low-rank matrix and a diagonally dominant matrix, and we call this problem the "Diagonally-Dominant Principal Component Analysis (DD-PCA)". DD-PCA is an…

Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between $\textbf{mbCcl}$ and $\textbf{Cila}$. In order to overcome this limitation, we…

We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear Algebra Appl. 516 (2017)]. Our method also allows us to prove…

In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

As non-commutative versions of the quasi-arithmetic mean, we consider the Lim-P\'{a}lfia's power mean, R\'{e}nyi right mean and R\'{e}nyi power means. We prove that the Lim-P\'{a}lfia's power mean of order $t \in [-1,0)$ is weakly…

In this paper we study some weak majorization properties with applications for the trees. A strongly notion of majorization is introduced and Hardy-Littlewood-Polya's inequality is generalized.

One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…

We give general lower bounds on the maximal determinant of n by n {+1,-1}-matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of de Launey and Levin (2010) and, for certain…