Related papers: On Matrix Rearrangement Inequalities

We investigate a rearrangement inequality for pairs of n-square matrices: Let |A\|_p denote the C^p trace norm of an n-square matrix A. Consider the quantity |A+B|_p^p + |A-B|_p^p. Under certain positivity conditions, we show that this is…

Let $||X||_p=\text{Tr}[(X^\ast X)^{p/2}]^{1/p}$ denote the $p$-Schatten norm of a matrix $X\in M_{n\times n}(\mathbb{C})$, and $\sigma(X)$ the singular values with $\uparrow$ $\downarrow$ indicating its increasing or decreasing…

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…

Consider the following noncommutative arithmetic-geometric mean inequality: given positive-semidefinite matrices $\mathbf{A}_1, \dots, \mathbf{A}_n$, the following holds for each integer $m \leq n$: $$ \frac{1}{n^m}\sum_{j_1, j_2, \dots,…

We consider the question of the boundedness of matrix products $A_{n}B_{n}\cdots A_{1}B_{1}$ with factors from two sets of matrices, $A_{i}\in\mathscr{A}$ and $B_{i}\in\mathscr{B}$, due to an appropriate choice of matrices $\{B_{i}\}$. It…

It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…

We describe all inequalities among generalized diagonals in positive semi-definite matrices. These turn out to be governed by a simple partial order on the symmetric group. This provides an analogue of results of Drake, Gerrish, and…

For a nonnegative matrix A and real diagonal matrix D, two known inequalities on the spectral radius, r(A^2 D^2) >= r(AD)^2 and r(A) r(A D^2) >= r(AD)^2, leave open the question of what determines the order of r(A^2 D^2) with respect to…

Two complex matrix pairs $(A,B)$ and $(A',B')$ are contragrediently equivalent if there are nonsingular $S$ and $R$ such that $(A',B')=(S^{-1}AR,R^{-1}BS)$. M.I. Garc\'{\i}a-Planas and V.V. Sergeichuk (1999) constructed a miniversal…

The spectrum of a real and symmetric $N\times N$ matrix determines the matrix up to unitary equivalence. More spectral data is needed together with some sign indicators to remove the unitary ambiguities. In the first part of this work we…

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[…

Let $A, B$ and $X$ be $n\times n$ matrices such that $A, B$ are positive semidefinite. We present some refinements of the matrix Cauchy-Schwarz inequality by using some integration techniques and various refinements of the Hermite--Hadamard…

A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B),…

$ \newcommand{\schs}{\scriptstyle{\mathsf{S}}_1} $For all $n \ge 1$, we give an explicit construction of $m \times m$ matrices $A_1,\ldots,A_n$ with $m = 2^{\lfloor n/2 \rfloor}$ such that for any $d$ and $d \times d$ matrices…

A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…

Given $2n \times 2n$ real symmetric positive semidefinite matrix $A$ with symplectic kernel, there exists a real $2n \times 2n$ \emph{symplectic matrix} $M$ such that $M^TAM= D \oplus D$, where $D$ is an $n \times n$ non-negative diagonal…

Given a positive integer $n$ and a nonnegative integer $k$ with $k\leq n$, we denote by $\mathcal{A}(n,k)$ the class of all $n$-by-$n$ $(0,1)$-matrices with constant row and column sums $k$. In this paper, we show that the Bruhat order and…

Let $A$ be an $m\times m$ positive semidefinite block matrix with each block being $n$-square. We write $\mathrm{tr}_1$ and $\mathrm{tr}_2$ for the first and second partial trace, respectively. In this paper, we prove the following…

We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words…

The Steinitz lemma, a classic from 1913, states that $a_1,\ldots,a_n$, a sequence of vectors in $\R^d$ with $\sum_1^n a_i=0$, can be rearranged so that every partial sum of the rearranged sequence has norm at most $2d\max \|a_i\|$. In the…