Related papers: Nonnegative rank of a matrix with one negative eig…

We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.

In this note, we consider arbitrary finite-dimensional real algebras containing a copy of complex numbers. It is proved that matrices with entries from an arbitrary finite-dimensional real algebra containing a square root of negative one in…

In this note we show that every (real or complex) vector bundle over a compact rank one symmetric space carries, after taking the Whitney sum with a trivial bundle of sufficiently large rank, a metric with nonnegative sectional curvature.…

In this paper we parameterize non-negative matrices of sum one and rank at most two. More precisely, we give a family of parameterizations using the least possible number of parameters. We also show how these parameterizations relate to a…

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a sum of symmetric outer product of vectors. A rank-1 order-k…

In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.

We give a short proof of a recent result by Bernik, Mastnak, and Radjavi, stating that an irreducible group of complex matrices with nonnegative diagonal entries is diagonally similar to a group of nonnegative monomial matrices. We also…

The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization,…

A factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative, is called the Symmetric Nonnegative Matrix…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

We consider nonsmooth rank-one symmetric matrix factorization. It has no spurious second-order stationary points.

We give sufficient conditions on a symmetric tensor S in S^dF^n to satisfy the equality: the symmetric rank of S, denoted as srank(S), is equal to the rank of S, denoted as rank(S). This is done by considering the rank of the unfolded S…

In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Kronecker product. This quantity is important since it governs…

The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.

We obtain using exponential quadratic sums, explicit expressions for the number of triple persymmetric matrices over F_2 of given rank. (A matrix [a(i,j)] is persymmetric if a(i,j) = a(r,s) for i+j = r+s)

We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…

We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…