Related papers: Matrices with totally positive powers and their ge…
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…
An introduction to total positivity (TP), with the emphasis on efficient TP criteria and parametrizations of TP matrices. Intended for general mathematical audience.
In this paper, we consider matrices whose entries are combinatorial sequences which can be expressed in terms of a convolution of elementary and complete homogeneous symmetric functions. We establish the total positivity of these matrices…
Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…
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…
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…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…
The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy…
Let $p_1<p_2<\cdots<p_n$ be positive real numbers. It is shown that the matrix whose $i,j$ entry is $(p_i+p_j)^{p_i+p_j}$ is infinitely divisible, nonsingular and totally positive.
We develop a systematic theory of eventually positive semigroups of linear operators mainly on spaces of continuous functions. By eventually positive we mean that for every positive initial condition the solution to the corresponding Cauchy…
We prove that the only entrywise transforms of rectangular matrices which preserve total positivity or total non-negativity are either constant or linear. This follows from an extended classification of preservers of these two properties…
The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal…
A matrix is called a P-matrix if all its principal minors are positive. P-matrices have found important applications in functional analysis, mathematical programming, and dynamical systems theory. We introduce a new class of real matrices…
We study which matrices are sums of idempotents over a field of non-zero characteristic; in particular, we prove that any such matrix, provided it is large enough, is actually a sum of five idempotents, and even of four when the field is a…
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…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
Let $A=[a_{n,k}]_{n,k\ge 0}$ be an infinite lower triangular matrix defined by the recurrence $$a_{0,0}=1,\quad a_{n+1,k}=r_{k}a_{n,k-1}+s_{k}a_{n,k}+t_{k+1}a_{n,k+1},$$ where $a_{n,k}=0$ unless $n\ge k\ge 0$ and $r_k,s_k,t_k$ are all…