Related papers: The Normal Defect of Some Classes of Matrices
Given an integer n greater of equal to 3, we investigate the minimal dimension of a subalgebra of M_n(K) with a trivial centralizer. It is shown that this dimension is 5 when n is even and 4 when it is odd. In the latter case, we also…
Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…
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…
Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…
A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…
The generalized defect D(U) of a unitary NxN matrix U with no zero entries is the dimension of the real space of directions, moving into which from U we do not disturb the moduli |U_ij| as well as the Gram matrix U'*U in the first order.…
The rank of the $9\times 9$ matrix $$ \left( \begin{array}{cccc|c|cccc} 1&1&0&0&1&0&0&0&0\\ 1&1&0&0&0&0&0&0&0\\ 0&0&1&1&1&0&0&0&0\\ 0&0&1&1&0&0&0&0&0\\\hline 0&0&0&0&1&0&1&0&1\\\hline 0&0&0&0&0&1&1&0&0\\ 0&0&0&0&0&1&1&0&0\\…
Given a positive definite matrix $A\in \mathbb{C}^{n\times n}$ and a Hermitian matrix $D\in \mathbb{C}^{m\times m}$, we characterize under which conditions there exists a strictly contractive matrix $K\in \mathbb{C}^{n\times m}$ such that…
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…
While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…
The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…
A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
We study the minimal dimension of maximal commutative subalgebras of the matrix algebra $M_n(k)$ over an algebraically closed field. While examples with dimension strictly smaller than n are known for $n \geq 14$, no such examples are known…
For each square complex matrix, V. I. Arnold constructed a normal form with the minimal number of parameters to which a family of all matrices B that are close enough to this matrix can be reduced by similarity transformations that smoothly…
We initiate a study of the zero-nonzero patterns of n by n alternating sign matrices. We characterize the row (column) sum vectors of these patterns and determine their minimum term rank. In the case of connected alternating sign matrices,…
The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…