In further pursuit of a solution to the celebrated nonnegative inverse eigenvalue problem, Loewy and London [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90] posed the problem of characterizing all polynomials that preserve all nonnegative matrices of a fixed order. If $\mathscr{P}_n$ denotes the set of all polynomials that preserve all $n$-by-$n$ nonnegative matrices, then it is clear that polynomials with nonnegative coefficients belong to $\mathscr{P}_n$. However, it is known that $\mathscr{P}_n$ contains polynomials with negative entries. In this work, novel results for $\mathscr{P}_n$ with respect to the coefficients of the polynomials belonging to $\mathscr{P}_n$. Along the way, a generalization for the even-part and odd-part are given and shown to be equivalent to another construction that appeared in the literature. Implications for further research are discussed.
In this paper, we show that all totally nonnegative GCD matrices are always divisors of the corresponding LCM matrices in the ring $\mathbb{M}_{n}(\mathbb{Z})$. We also introduce \lq\lq column monotone matrices" used to construct all totally nonegative GCD matrices.
We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.
The problem of determining necessary and sufficient conditions for a set of real numbers to be the eigenvalues of a symmetric nonnegative matrix is called the symmetric nonnegative inverse eigenvalue problem (SNIEP). In this paper we solve SNIEP in the case of trace zero symmetric nonnegative 5x5 matrices.
Given a finite set $\{M_0,\dots,M_{d-1}\}$ of nonnegative $2\times 2$ matrices and a nonnegative column-vector $V$, we associate to each $(ω_n)\in\{0,\dots,d-1\}^\mathbb N$ the sequence of the column-vectors $\displaystyle{M_{ω_1}\dots M_{ω_n}V\over\Vert M_{ω_1}\dots M_{ω_n}V\Vert}$. We give the necessary and sufficient condition on the matrices $M_k$ and the vector $V$ for this sequence to converge for all \hbox{$(ω_n)\in\{0,\dots,d-1\}^\mathbb N$} such that $\forall n,\ M_{ω_1}\dots M_{ω_n}V\ne\begin{pmatrix}0\\0\end{pmatrix}$.
We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n nonnegative (element-wise) matrix}. This set plays a role in the Nonnegative Inverse Eigenvalue Problem. Clark and Paparella conjectured that P(n+1) is strictly contained in P(n). We prove this conjecture.
Using matrix function theory, Perron-Frobenius theory, combinatorial matrix theory, and elementary number theory, we characterize, classify, and describe in terms of the Jordan canonical form the matrix pth-roots of imprimitive irreducible nonnegative matrices. Preliminary results concerning the matrix roots of reducible matrices are provided as well.
In this paper, we prove that the semigroups of invertible matrices with nonnegative elements over linearly oredered associative rings are elementarily equivalent if and only if the matrices have the same dimension and the rings are elementarily equivalent as ordered rings.
It is known that the critical exponent (CE) for conventional, continuous powers of $n$-by-$n$ doubly nonnegative (DN) matrices is $n-2$. Here, we consider the larger class of diagonalizable, entry-wise nonnegative $n$-by-$n$ matrices with nonnegative eigenvalues (GDN). We show that, again, a CE exists and are able to bound it with a low-coefficient quadratic. However, the CE is larger than in the DN case; in particular, 2 for $n=3$. There seems to be a connection with the index of primitivity, and a number of other observations are made and questions raised. It is shown that there is no CE for…
We prove that there exists an exponent beyond which all continuous conventional powers of n-by-n doubly nonnegative matrices are doubly nonnegative. We show that this critical exponent cannot be less than $n-2$ and we conjecture that it is always $n-2$ (as it is with Hadamard powering). We prove this conjecture when $n<6$ and in certain other special cases. We establish a quadratic bound for the critical exponent in general.
In this paper we prove that every automorphism of the semigroup of invertible matrices with nonnegative elements over a linearly oredered associative ring on some specially defined subgroup concides with the composition of an inner automorphism of the semigroup, an automorphism of the ring preserving the order, and a central homothety.
This paper studies commuting matrices in max algebra and nonnegative linear algebra. Our starting point is the existence of a common eigenvector, which directly leads to max analogues of some classical results for complex matrices. We also investigate Frobenius normal forms of commuting matrices, particularly when the Perron roots of the components are distinct. For the case of max algebra, we show how the intersection of eigencones of commuting matrices can be described, and we consider connections with Boolean algebra which enables us to prove that two commuting irreducible matrices in max a…
Roots of matrices are well-studied. The conditions for their existence are understood: The block sizes of nilpotent Jordan blocks, arranged in pairs, have to satisfy some simple algebraic property. More interesting are structured roots of structured matrices. Probably the best known example is the existence and uniqueness of positive definite square roots of a positive definite matrix. If one drops the requirement of positive definiteness of the square root, it turns out that there exists an abundance of square roots. Here a description of all canonical forms of all square roots is possible an…
In this article the well known "Perron-Frobenius theory" is investigated involving the higher rank numerical range $Λ_{k}(A)$ of an irreducible and entrywise nonnegative matrix $A$ and extending the notion of elements of maximum modulus in $Λ_{k}(A)$. Further, an application of this theory to the $Λ_{k}(L(λ))$ of a Perron polynomial $L(λ)$ is elaborated via its companion matrix $C_{L}$.
Suppose that R is an ordered ring, G_n(R) is a subsemigroup of $GL_n(R)$, consisting of all matrices with nonnegative elements. A.V. Mikhalev and M.A. Shatalova described all automorphisms of G_n(R), where R is a linearly ordered skewfield and n>1. E.I. Bunina and A.V. Mikhalev found all automorphisms of G_n(R), if R is an arbitrary linearly ordered associative ring with 1/2, n>2. In this paper we describe automorphisms of G_n(R), if R is a commutative partially ordered ring, containing Q, n>2.
Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that $2\times 2$ minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial interpretation for the minors of minor matrices in terms of the weights of families of paths in a network.
A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that $\mathscr{P}_3 \subset \mathscr{P}_2$, which was previously unknown. A new characterization is given for polynomials that preserve nonnegative circulant matrices of order two.
For matrices with all nonnegative entries, the Perron-Frobenius theorem guarantees the existence of an eigenvector with all nonnegative components. We show that the existence of such an eigenvector is also guaranteed for a very different class of matrices, namely real symmetric matrices with exactly two eigenvalues. We also prove a partial converse, that among real symmetric matrices with any more than two eigenvalues there exist some having no nonnegative eigenvector.
Let $λ_1 \geq λ_2 \geq λ_3 \geq λ_4 \geq λ_5 \geq -λ_1$ be real numbers such that $\sum_{i=1}^5 λ_i =0$. In \cite{oren}, O. Spector prove that a necessary and sufficient condition for $λ_1, λ_2, λ_3, λ_4, λ_5$ to be the eigenvalues of a symmetric nonnegative $5 \times 5$ matrix is "$λ_2+λ_5<0$ and $\sum_{i=1}^5 λ_{i}^{3} \geq 0"$. In this article, we show that this condition is also a necessary and sufficient condition for $λ_1, λ_2, λ_3, λ_4, λ_5$ to be the spectrum of a traceless bisymmetric nonnegative $5 \times 5$ matrix.
In this paper we present some symmetric nonnegative 5x5 matrix families that realize a previously unknown region. We also prove that these and other symmetric nonnegative 5x5 matrix families are closed under perturbations first presented in W. Guo. Eigenvalues of nonnegative matrices. Linear Algebra and its Applications, 266:261-270, 1997.
A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k = n-1$ and when $k = n-2$, restricted to unitriangular matrices. For these two cases, we prove that the set of $k$-nonnegative matrices can be partitioned into cells based on their factorizations into generators, generalizing the notion of Bruhat cells from totally nonnegative matrices. Like Bruhat cells, these cells are homeomorphic to open balls and have a to…
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 nonnegative matrices up to similarity. Also we find all realizable dimensions of algebras generated by two nonnegative semi-commuting matrices. The last result provides the solution to the problem posed by M. Kandić, K. Šivic (2017).
In this paper, we answer the various forms of nonnegative inverse eigenvalue problems with prescribed diagonal entries for order three: real or complex general matrices, symmetric stochastic matrices, and real or complex doubly stochastic matrices. We include the known cases, the symmetric matrices and real or complex stochastic matrices, to compare the other results and for completeness. In addition, for a given list of eigenvalues, we compute the exact range for the largest value of the diagonal entries of the various nonnegative matrices.
We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no column of $A$ is a scalar multiple of any other column of $A.$ A particular emphasis is given to the study of rank, positivity and monotonicity of Hadamard powers of rank two, positive semidefinite matrices that have all entries positive.
Let $A$ be a nonnegative symmetric $ 5 \times 5 $ matrix with eigenvalues $ λ_1 \geq λ_2 \geq λ_3 \geq λ_4 \geq λ_5 $. We show that if $ \sum_{i=1}^{5} λ_{i} \geq \frac{1}{2} λ_1 $ then $ λ_3 \leq \sum_{i=1}^{5} λ_{i} $. McDonald and Neumann showed that $ λ_1 + λ_3 + λ_4 \geq 0 $. Let $ σ= \left( λ_1, λ_2, λ_3, λ_4, λ_5 \right) $ be a list of decreasing real numbers satisfying: 1. $ \sum_{i=1}^{5} λ_{i} \geq \frac{1}{2} λ_1 $, 2. $ λ_3 \leq \sum_{i=1}^{5} λ_{i} $, 3. $ λ_1 + λ_3 + λ_4 \geq 0 $, 4. the Perron property, that is $ λ_1 = \max_{λ\in σ} \left| λ\right| $. We show that $ σ$ is the sp…
Arising from the classification of the matrix-roots of a nonnegative imprimitive irreducible matrix, we present results concerning the Jordan chains of an $h$-cyclic matrix. We also present ancillary results applicable to nonnegative imprimitive irreducible matrices and demonstrate these results via examples.
Call an $n$-by-$n$ invertible matrix $S$ a \emph{Perron similarity} if there is a real non-scalar diagonal matrix $D$ such that $S D S^{-1}$ is entrywise nonnegative. We give two characterizations of Perron similarities and study the polyhedra $\mathcal{C}(S) := \{ x \in \mathbb{R}^n: S D_x S^{-1} \geq 0,~D_x := \text{diag}(x) \}$ and $\mathcal{P})(S) := \{x \in \mathcal{C}(S) : x_1 = 1 \}$, which we call the \emph{Perron spectracone} and \emph{Perron spectratope}, respectively. The set of all normalized real spectra of diagonalizable nonnegative matrices may be covered by Perron spectratopes,…
If a left-product $M_n... M_1$ of square complex matrices converges to a nonnull limit when $n\to\infty$ and if the $M_n$ belong to a finite set, it is clear that there exists an integer $n_0$ such that the $M_n$, $n\ge n_0$, have a common right-eigenvector $V$ for the eigenvalue 1. Now suppose that the $M_n$ are nonnegative and that $V$ has positive entries. Denoting by $Δ$ the diagonal matrix whose diagonal entries are the entries of $V$, the stochastic matrices $S_n=Δ^{-1}M_nΔ$ satisfy $M_n... M_{n_0}=ΔS_n... S_{n_0}Δ^{-1}$, so the problem of the convergence of $M_n... M_1$ reduces to the o…
Motivated by a work of Boros, Brualdi, Crama and Hoffman, we consider the sets of (i) possible Perron roots of nonnegative matrices with prescribed row sums and associated graph, and (ii) possible eigenvalues of complex matrices with prescribed associated graph and row sums of the moduli of their entries. To characterize the set of Perron roots or possible eigenvalues of matrices in these classes we introduce, following an idea of Al'pin, Elsner and van den Driessche, the concept of row uniform matrix, which is a nonnegative matrix where all nonzero entries in every row are equal. Furthermore,…
We study the max-algebraic analogue of equations involving Z-matrices and M-matrices, with an outlook to a more general algebraic setting. We show that these equations can be solved using the Frobenius trace down method in a way similar to that in non-negative linear algebra, characterizing the solvability in terms of supports and access relations. We give a description of the solution set as combination of the least solution and the eigenspace of the matrix, and provide a general algebraic setting in which this result holds.
The main goal of this work is to determine which entire functions preserve nonnegativity of matrices of a fixed order $n$ -- i.e., to characterize entire functions $f$ with the property that $f(A)$ is entrywise nonnegative for every entrywise nonnegative matrix $A$ of size $n\times n$. Towards this goal, we present a complete characterization of functions preserving nonnegativity of (block) upper-triangular matrices and those preserving nonnegativity of circulant matrices. We also derive necessary conditions and sufficient conditions for entire functions that preserve nonnegativity of symmetri…
A nonnegative matrix A is said to be strongly robust if its max-algebraic eigencone is universally reachable, i.e., if the orbit of any initial vector ends up with a max-algebraic eigenvector of A. Consider the case when the initial vector is restricted to an interval and A can be any matrix from a given interval of nonnegative circulant matrices. The main aim of this paper is to classify and characterize the six types of interval robustness in this situation. This naturally leads us also to study the max-algebraic spectral theory of circulant matrices and the relation of inclusion between att…
Let $A_kA_{k-1}\cdots A_1$ be product of some nonnegative 2-by-2 matrices. In general, its elements are hard to evaluate. Under some conditions, we show that $\forall i,j\in\{1,2\},$ $(A_kA_{k-1}\cdots A_1)_{i,j}\sim c\varrho(A_k)\varrho(A_{k-1})\cdots \varrho(A_1)$ as $k\rightarrow\infty,$ where $\varrho(A_n)$ is the spectral radius of the matrix $A_n$ and $c\in(0,\infty)$ is some constant, so that the elements of $A_kA_{k-1}\cdots A_1$ can be estimated. As applications, consider the maxima of certain excursions of (2,1) and (1,2) random walks with asymptotically zero drifts. We get some deli…
We show that the weak and strong forms of the Generalized Spectral Conjecture (GSC) of Boyle and Handelman are equivalent. The GSC asserts that well understood necessary spectral conditions on a square matrix A over a subring S of the reals are sufficient for that matrix to be shift equivalent over S (in the weak form) or strong shift equivalent over S (in the strong form) to a primitive matrix over S. The foundation of this work is the recent result that the group NK_1(S) of algebraic K-theory exactly captures the refinement of shift equivalence over S by strong shift equivalence over S. The …
A singular M-matrix perturbed by a nonnegative rank one matrix has positive principal minors; is it D-stable?
Donders Institute for Brain, Cognition and Behaviour, Radboud University Nijmegen（拉德堡德大学尼梅根大脑、认知与行为多德斯研究所）；Department of Mathematics, FEW, VU university Amsterdam（阿姆斯特丹自由大学FEW数学系）；Unit for BMI, North-West University（西北大学BMI单元）
We consider a closed set S in R^n and a linear operator Φon the polynomial algebra R[X_1,...,X_n] that preserves nonnegative polynomials, in the following sense: if f\geq 0 on S, then Φ(f)\geq 0 on S as well. We show that each such operator is given by integration with respect to a measure taking nonnegative functions as its values. This can be seen as a generalization of Haviland's Theorem, which concerns linear functionals on polynomial algebras. For compact sets S we use the result to show that any nonnegativity preserving operator is a pointwise limit of very simple nonnegativity preserver…
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights with nonnegative coefficients. A combinatorial explanation of this phenomenon involves loop-erased walks. Applications include total positivity of hitting matrices of Brownian motion in planar domains.
We generalize the well known characterizations of totally nonnegative and oscillatory matrices, due to F.R.Gantmacher, M.G.Krein, A.Whitney, C.Loewner, M.Gasca, and J.M.Pena to the case of an arbitrary complex semisimple Lie group.
The nonnegative inverse eigenvalue problem (NIEP) is to characterize the spectra of entrywise nonnegative matrices. A finite multiset of complex numbers is called realizable if it is the spectrum of an entrywise nonnegative matrix. Monov conjectured that the k\textsuperscript{th}-moments of the list of critical points of a realizable list are nonnegative. Johnson further conjectured that the list of critical points must be realizable. In this work, Johnson's conjecture, and consequently Monov's conjecture, is established for a variety of important cases including Ciarlet spectra, Sule\uımanova…
Let $X = (x_1,\dots,x_n)$ be a vector of distinct positive integers. The $n \times n$ matrix $S = S(X) := (\gcd(x_i,x_j))_{i,j=1}^n$, where $\gcd(x_i,x_j)$ denotes the greatest common divisor of $x_i$ and $x_j$, is called the greatest common divisor (GCD) matrix on $X$. By a surprising result of Beslin and Ligh [Linear Algebra and Appl. 118], all GCD matrices are positive definite. In this paper, we completely characterize the GCD matrices satisfying the stronger property of being totally nonnegative (TN) or totally positive (TP). As we show, a GCD matrix is never TP when $n \geq 3$, and is TN…
