On the exponent of a primitive matrix containing a primitive submatrix
From MaRDI portal
(Redirected from Publication:1362661)
A square matrix \(A\) of order \(n\) with nonnegative entries is said to be primitive if \(A^m\) has all positive entries for some \(m\geq 1\). The smallest such \(m\) is called the exponent of \(A\). For a primitive matrix of order \(n+k\) having a primitive submatrix of order \(n\), it is shown that the exponent of \(A\) is at most \((n- 1)^2+ 2k+1\).
Recommendations
Cites work
- A bound on the exponent of primitivity in terms of diameter
- A diameter bound on the exponent of a primitive directed graph
- A system of gaps in the exponent set of primitive matrices
- Combinatorial matrix theory
- On Powers of Non-Negative Matrices
- The exponents of incidence matrices
- Unzerlegbare, nicht negative Matrizen
Cited in
(7)- On the bounds of exponents of primitive (0, 1) matrices
- Exponents of nonnegative matrix pairs
- On the sequence of power of a stochastic matrix with large exponent
- scientific article; zbMATH DE number 537360 (Why is no real title available?)
- Exponents of primitive symmetric companion matrices
- scientific article; zbMATH DE number 2245604 (Why is no real title available?)
- A note on the eigenvalues of a primitive matrix with large exponent
This page was built for publication: On the exponent of a primitive matrix containing a primitive submatrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362661)