Related papers: On Matrix Rearrangement Inequalities

We show that every principal submatrix of a square matrix $A$ with only entries in $\{0,1,-1\}$ has even rank if and only if $A$ is skew-symmetric up to multiplication of rows/columns by $-1$.

Let $P_n$ be the $n$-step right product $A_1\cdots A_n$, where $A_1,A_2,\dots$ is a given infinite sequence of $d\times d$ matrices with nonnegative entries. In a wide range of situations, the normalized matrix product $P_n/{\Vert…

For given real or complex $m \times n$ data matrices $X$, $Y$, we investigate when there is a matrix $A$ such that $AX = Y$, and $A$ is invertible, Hermitian, positive (semi)definite, unitary, an orthogonal projection, a reflection, complex…

We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…

Sylvester's criterion characterizes positive definite (PD) and positive semidefinite (PSD) matrices without the need of eigendecomposition. It states that a symmetric matrix is PD if and only if all of its leading principal minors are…

We prove two inequalities regarding the ratio $\det(A+D)/\det A$ of the determinant of a positive-definite matrix $A$ and the determinant of its perturbation $A+D$. In the first problem, we study the perturbations that happen when positive…

We prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the…

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

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…

Assume <aleph_0,aleph_1>-><lambda,lambda^+>. Assume M is a model of a first order theory T of cardinality at most lambda^+ in a vocabulary L(T) of cardinality <= lambda . Let N be a model with the same vocabulary. Let Delta be a set of…

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…

Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by…

In this paper, we investigate the question of when the equations $A^{*s}A^{s}=(A^{*}A)^{s}$ for all $s \in S$, where $S$ is a finite set of positive integers, imply the quasinormality or normality of $A$. In particular, it is proved that if…

We present inequalities related to generalized matrix function for positive semidefinite block matrices. We introduce partial generalized matrix functions corresponding to partial traces, and then provide a unified extension of the recent…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of scattered factors from a given set, necessary to uniquely…

We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any $n \times n$ matrix pencil $(A,B)$. The bulk of the algorithm rests on a randomized divide-and-conquer eigensolver for the generalized…

For $k=1,\ldots,K$, let $A_k$ and $B_k$ be positive semidefinite matrices such that, for each $k$, $A_k$ commutes with $B_k$. We show that, for any unitarily invariant norm, \[ |||\sum_{k=1}^K A_kB_k||| \le ||| (\sum_{k=1}^K…

For any positive invertible matrix $A$ and any normal matrix $B$ in $M_{n}({\Bbb C})$, we investigate whether the inequality $ ||A\sharp (B^{*}A^{-1}B)||\geq ||B|| $ is true or not, where $\sharp$ denotes the geometric mean and $||\cdot||$…

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…