Related papers: On matrices whose exponential is a P-matrix
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
The purpose of the present work is to introduce the concept of relative EP matrix of a rectangular matrix relative to a partial isometry (or, in short, $T$-EP matrix) hitherto unknown. We extend various basic results on EP matrices and we…
A real square matrix $A$ is called a P-matrix if all its principal minors are positive. Using the sign non-reversal property of matrices, the notion of P-matrix has been recently extended by Kannan and Sivakumar to infinite-dimensional…
A P-matrix is a square matrix $X$ such that all principal submatrices of $X$ have positive determinant. Such matrices appear naturally in instances of the linear complementarity problem, where these are precisely the matrices for which the…
It is well known that a square complex matrix is called EP if it commutes with its Moore-Penrose inverse. In this paper, new classes of matrices which extend this concept are characterized. For that, we consider commutative equalities given…
The principal pivot transform (PPT) of a matrix A partitioned relative to an invertible leading principal submatrix is a matrix B such that A [x_1^T x_2^T]^T = [y_1^T y_2^T]^T if and only if B [y_1^T x_2^T]^T = [x_1^T y_2^T]^T, where all…
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…
In this paper, we explore the property of eventual exponential positivity (EEP) in complex matrices. We show that this property holds for the real part of the matrix exponential for a certain class of complex matrices. Next, we present the…
In this article, we introduce an exponential for tropical matrices and show that this series is essential for the analysis of certain kinds of stability in discrete event dynamic systems. A notion of a generalised eigenvector is introduced…
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…
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…
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…
Eventually positive matrices are real matrices whose powers become and remain strictly positive. As such, eventually positive matrices are a fortiori matrix roots of positive matrices, which motivates us to study the matrix roots of…
The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…
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…
In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…
A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
A nonnegative matrix $A$ is said to be {\it primitive} if for some positive integer $m$, entries in $A^m$ are positive, notationally represented as $A^m>0.$ The smallest such $m$ is called the {\it exponent} of $A$, denoted $exp(A).$ For…