Related papers: Totally positive skew-symmetric matrices

It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…

We provide a complete classification of quaternionic skew-Hermitian symmetric spaces, namely symmetric spaces that admit a torsion-free ${\rm SO}^{*}(2n){\rm Sp}(1)$-structure for arbitrary $n>1$. Moreover, we prove that any homogeneous…

An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…

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$.

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…

A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program. We propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in…

We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…

This paper is a self-contained exposition of the geometry of symmetric positive-definite real $n\times n$ matrices $\operatorname{SPD}(n)$, including necessary and sufficent conditions for a submanifold $\mathcal{N}…

We give a useful new characterization of the set of all completely positive, trace-preserving (i.e., stochastic) maps from 2x2 matrices to 2x2 matrices. These conditions allow one to easily check any trace-preserving map for complete…

The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…

Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative.…

Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…

A doubly nonnegative matrix can be written as a Gramian matrix, and a completely positive matrix can therefore be written as a Gramian matrix of some nonnegative vectors. In this paper, we introduce Gramian tensors and study 2-dimension…

The aim of this paper is to discuss a relationship between total positivity and planar directed networks. We show that the inverse boundary problem for these networks is naturally linked with the study of the totally nonnegative…

A Lagrangian submanifold in an almost Calabi-Yau manifold is called positive if the real part of the holomorphic volume form restricted to it is positive. An exact isotopy class of positive Lagrangian submanifolds admits a natural…

In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…

We introduce a countable collection of positivity classes for Hermitian symmetric functions on a complex manifold, and establish their basic properties. We study a related notion of stability. The first main result shows that, if the…

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

A $n$-by-$n$ matrix is called totally positive ($TP$) if all its minors are positive and $TP_k$ if all of its $k$-by-$k$ submatrices are $TP$. For an arbitrary totally positive matrix or $TP_k$ matrix, we investigate if the $r$th compound…

In this paper, we prove that any collocation matrix of Bessel polynomials at positive points is strictly totally positive, that is, all its minors are positive. Moreover, an accurate method to construct the bidiagonal factorization of these…