Related papers: Total negativity: Characterizations and single-vec…
A matrix $A$ is totally positive (or non-negative) of order $k$, denoted $TP_k$ (or $TN_k$), if all minors of size $\leq k$ are positive (or non-negative). It is well-known that such matrices are characterized by the variation diminishing…
A matrix $A$ is called totally positive (or totally non-negative) of order $k$, denoted by TP_k (or TN_k), if all minors of size at most $k$ are positive (or non-negative). These matrices have featured in diverse areas in mathematics,…
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.…
A matrix is called totally nonnegative (TN) if all its minors are nonnegative, and totally positive (TP) if all its minors are positive. Multiplying a vector by a TN matrix does not increase the number of sign variations in the vector. In a…
A matrix is called strictly sign-regular of order $k$ (denoted by $SSR_k$) if all its $k\times k$ minors are non-zero and have the same sign. For example, totally positive matrices, i.e., matrices with all minors positive, are $SSR_k$ for…
Variation diminution (VD) is a fundamental property in total positivity theory, first studied in 1912 by Fekete-P\'olya for one-sided P\'olya frequency sequences, followed by Schoenberg, and by Motzkin who characterized sign regular (SR)…
A $k$-positive matrix is a matrix where all minors of order $k$ or less are positive. Computing all such minors to test for $k$-positivity is inefficient, as there are $\sum_{\ell=1}^k \binom{n}{\ell}^2$ of them in an $n\times n$ matrix.…
A rectangular matrix is called totally positive, if all its minors are positive. A point of a real Grassmanian manifold $G_{l,m}$ of $l$-dimensional subspaces in $\mathbb R^m$ is called strictly totally positive, if one can normalize its…
Hermitian positive definite, totally positive, and nonsingular M-matrices enjoy many common properties, in particular: (A) positivity of all principal minors, (B) weak sign symmetry, (C) eigenvalue monotonicity, (D) positive stability. The…
We establish a characterization of almost $P$-matrices via a sign non-reversal property. In this we are inspired by the analogous results for $N$-matrices. Next, the interval hull of two $m \times n$ matrices $A=(a_{ij})$ and $B =…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
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…
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…
The concept of double nonnegativity of matrices is generalized to doubly nonnegative tensors by means of the nonnegativity of all entries and $H$-eigenvalues. This generalization is defined for tensors of any order (even or odd), while it…
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…
A matrix $A\in \mathbb{R}^{m \times n}$ is strictly sign regular/SSR (or sign regular/SR) if for each $1 \leq k \leq \min\{m,n\}$, all (non-zero) $k\times k$ minors of $A$ have the same sign. This class of matrices contains the totally…
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…
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…
Let ${\bf a}=(a_1, a_2, \ldots, a_n)$ and ${\bf e}=(e_1, e_2, \ldots, e_n)$ be real sequences. Denote by $M_{{\bf e}\rightarrow {\bf a}}$ the $(n+1)\times(n+1)$ matrix whose $(m,k)$ entry ($m, k \in \{0,\ldots, n\}$) is the coefficient of…
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…