Related papers: Integer matrices that are not copositive have cert…
A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…
We say that a square real matrix $M$ is \emph{off-diagonal nonnegative} if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix $M$, there…
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…
An $n\times n$ matrix $C$ is said to be {\it centrosymmetric} if it satisfies the relation $JCJ=C$, where $J$ is the $n\times n$ counteridentity matrix. Centrosymmetric matrices have a rich eigenstructure that has been studied extensively…
We provide two certificates of convexity for arbitrary basic semi-algebraic sets of $\R^n$. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both…
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal…
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show…
We consider linear recurrences with polynomial coefficients of Poincar\'e type and with a unique simple dominant eigenvalue. We give an algorithm that proves or disproves positivity of solutions provided the initial conditions satisfy a…
Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in…
We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and…
An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…
An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…
The independence number of a square matrix $A$, denoted by $\alpha(A)$, is the maximum order of its principal zero submatrices. Let $S_n^{+}$ be the set of $n\times n$ nonnegative symmetric matrices with zero trace. Denote by $J_n$ the…
A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…
We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization.
The notion of quantum matrix pairs is defined. These are pairs of matrices with non-commuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of…
A real square matrix $A$ of order $n \times n~ (n \geq 3)$ is called an $F_0$-matrix, if it is a $Z$-matrix (off-diagonal entries nonpositive), all of whose principal submatrices of orders at most $n-2$ are $M$-matrices while there is at…
In this paper, we investigate the conditions under which a diagonal quadratic form $\sum_{i=1}^{m}a_i X_i^2$ represents every $n \times n$ integral matrix, where $a_i$ ($1 \leq i \leq m$) are integers. For $n=2$, we give a necessary and…