An inequality for non-negative matrices

Let A be an n × n matrix with non-negative entries and no entry in (0, 1). We prove that there exist integers r, s with 0 r s 2ⁿ such that A^r A^s. We prove that 2ⁿ cannot be replaced with e√n log n. We also give an application to the theory of formal languages.     

Bounded indecomposable semigroups of non-negative matrices

A semigroup \({\mathfrak{S}}\) of non-negative n × n matrices is indecomposable if for every pair i, j ≤ n there exists \({S\in\mathfrak{S}}\) such that (S) _ij ≠ 0. We show that if there is a pair k, l such that \({\{(S)_{kl} : S\in\mathfrak{S}\}}\) is bounded then, after a simultaneous diagonal similarity, all the entries are in [0, 1]. We also provide quantitative versions of this result, as well as extensions to infinite-dimensional cases.     

Primes in the semigroup of non-negative matrices

A matrix A in the semigroup N_n of non-negative n×nmatrices is prime if A is not monomial and A=BC,BCεN_n implies that either B or C is monomial. One necessary and another sufficient condition are given for a matrix in N_n to be prime. It is proved that every prime in N_n is completely decomposable.     

On the eigenvalues of non-negative Jacobi matrices

The spectrum σ of a non-negative Jacobi matrix J is characterized. If J is also required to be irreducible, further conditions on σ are needed, some of which are explored.     

Perturbing non-real eigenvalues of non-negative real matrices

Let σ=(ρ,b+ic,b-ic,λ₄,…,λ_n) be the spectrum of an entry non-negative matrix and t?0. Laffey [T. J. Laffey, Perturbing non-real eigenvalues of nonnegative real matrices, Electron. J. Linear Algebra 12 (2005) 73-76] has shown that σ=(ρ+2t,b-t+ic,b-t-ic,λ₄,…,λ_n) is also the spectrum of some nonnegative matrix. Laffey (2005) has used a rank one perturbation for small t and then used a compactness argument to extend the result to all nonnegative t. In this paper, a rank two perturbation is used to deduce an explicit and constructive proof for all t?0.     

Primes in the semigroup of non-negative matrices

A matrix A in the semigroup N _n of non-negative n×nmatrices is prime if A is not monomial and A=BC,B CεN _n implies that either B or C is monomial. One necessary and another sufficient condition are given for a matrix in N _n to be prime. It is proved that every prime in N _n is completely decomposable.     

三阶单位上三角非负矩阵

根据矩阵分解性质及原子间的乘积关系,首先探究了单位上三角非负矩阵的原子因式分解性质,然后给出了任意单位上三角非负矩阵A的最小原子因式分解长度l(A)的计算公式,并得到了A具有最小的原子因式分解长度的其中一种分解,从而完善了相关文献中的结果.     

Compactness of eigenvectors for certain families of non-negative matrices

Conditions are given which guarantee that the normalized left eigenvectors of certain classes of non-negative matrices of unbounded dimension, interpreted as functions of [0, 1], form precompact sets in L₁. These eigenvectors are uniformly bounded above and in some cases uniformly bounded below.     

Entrywise relative perturbation bounds for exponentials of essentially non-negative matrices

A real square matrix is said to be essentially non-negative if all of its off-diagonal entries are non-negative. We establish entrywise relative perturbation bounds for the exponential of an essentially non-negative matrix. Our bounds are sharp and contain a condition number that is intrinsic to the exponential function. As an application, we study sensitivity of continuous-time Markov chains. J. Xue was supported by the National Science Foundation of China under grant number 10571031, the Program for New Century Excellent Talents in Universities of China and Shanghai Pujiang Program. Q. Ye was supported in part by NSF under Grant DMS-0411502.     

Maximum and minimum weighted diagonal sums of certain non-negative matrices

This paper extends the notion of diagonal sums of a square matrix to “weighted diagonal sums”. Using simple probabilistic arguments, most of the results of Wang [5] concerning the maximum and minimum diagonal sums of doubly stochastic matrices are extended to maximum and minimum weighted diagonal sums of stochastic matrices (Sec. 3). Two stronger versions of one of Wang's conjectures are also proven (Theorems 4.1 and 5.1), of which the latter easily generalizes to the case of non-negative matrices (Theorem 5.2). The paper ends with a few open questions and counter-examples.     

A note on a theorem of minc on irreducible non-negative matrices

A short proof is given for Mine's partial converse to a fundamental theorem of Frobenius on irreducible nonnegative matrices.     

Spectral radius of Hadamard product versus conventional product for non-negative matrices

We prove an inequality for the spectral radius of products of non-negative matrices conjectured by X. Zhan. We show that for all n×n non-negative matrices A and B, ρ(A°B)?ρ((A°A)(B°B))^1/2?ρ(AB), in which ° represents the Hadamard product.     

Probability matrices, non-negative rank, and parameterization of mixture models

In this paper, we parameterize non-negative matrices of sum one and rank at most two using the least possible number of parameters. We also show how this parameterization relates to a class of statistical models, known in Probability and Statistics as mixture models for contingency tables. In particular, we show how to use this parameterization to make some optimization problems computationally easier.     

A note on a theorem of minc on irreducible non-negative matrices

A short proof is given for Mine's partial converse to a fundamental theorem of Frobenius on irreducible nonnegative matrices.