Related papers: Perfect Copositive Matrices
We prove that checking if a partial matrix is partial totally positive is co-NP-complete. This contrasts with checking a conventional matrix for total positivity, for which we provide a cubic time algorithm. Checking partial sign regularity…
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,…
Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…
A linear map between real symmetric matrix spaces is positive if all positive semidefinite matrices are mapped to positive semidefinite ones. A real symmetric matrix is separable if it can be written as a summation of Kronecker products of…
Let $v_1$,..., $v_n$ be $n$ vectors in an inner product space. Can we find a natural number $d$ and positive (semidefinite) complex matrices $A_1$,..., $A_n$ of size $d \times d$ such that ${\rm Tr}(A_kA_l)= <v_k, v_l>$ for all $k,l=1,...,…
We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…
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 matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…
In this paper, eventually totally positive matrices (i.e. matrices all whose powers starting with some point are totally positive) are studied. We present a new approach to eventual total positivity which is based on the theory of…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible…
We investigate the tropical analogues of totally positive and totally nonnegative matrices. These arise when considering the images by the nonarchimedean valuation of the corresponding classes of matrices over a real nonarchimedean valued…
We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
We introduce a variant of de Bruijn words that we call perfect necklaces. Fix a finite alphabet. Recall that a word is a finite sequence of symbols in the alphabet and a circular word, or necklace, is the equivalence class of a word under…
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…
In this work we take a deep dive into the cone of copositive $3 \times 3$ matrices. In doing so we visualize the cone, make geometric observations about it, and prove them. We then use these observations to parametrize the set. In the…
A linear map $\Phi$ between matrix spaces is called cross-positive if it is positive on orthogonal pairs $(U,V)$ of positive semidefinite matrices in the sense that $\langle U,V\rangle:=\text{Tr}(UV)=0$ implies $\langle…
The paper is devoted to a study of the cone $\cop$ of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a subset of the cone $\cop$ and use them…
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable somebody to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a…