Bounds on the exponent of primitivity which depend on the spectrum and the minimal polynomial
The authors consider bounds on the exponent of primitivity of a nonnegative matrix which depend on the spectrum and the minimal polynomial. Let \(A\) be an \(n \times n\) nonnegative primitive matrix whose minimal polynomial has degree \(m\). They conjecture that a bound on the exponent of primitivity of \(A\) is given by \((m-1)^ 2+ 1\). The authors show that the only case for which they cannot prove the conjecture is when \(m \geq 5\), the number of distinct eigenvalues of \(A\) is \(m-1\) or \(m\), and the directed graph of \(A\) has no circuits of length shorter than \(m-1\), but at least one of its vertices lies on a circuit of length not shorter than \(m\). They also show that \(m(m-1)\) is always a bound on the exponent. To obtain these results the authors prove a lemma which shows that for a nonnegative matrix, the number of its distinct eigenvalues is an upper bound on the length of the shortest circuits in its directed graph.
- A system of gaps in the exponent set of primitive matrices
- Bounds for exponents of doubly stochastic primitive matrices
- Combinatorial matrix theory
- Gaps in the exponent set of primitive matrices
- Generalizations of the spectral theorem for matrices. II. Matrix polynomials over arbitrary fields
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 4021361 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3229576 (Why is no real title available?)
- Minimal polynomial and the rank of principal submatrices of a matrix
- On a combinatorial theorem and its application to nonnegative matrices
- On a conjecture about the exponent set of primitive matrices
- On exponents of primitive matrices
- On incidence matrices of directed graphs
- On Lewin and Vitek's conjecture about the exponent set of primitive matrices
- On nonnegative matrices
- On Powers of Non-Negative Matrices
- On the exponent of a primitive digraph
- On the Exponent of a Primitive, Nearly Reducible Matrix
- The exponent set of symmetric primitive (0,1) matrices with zero trace
- The exponents of incidence matrices
- The index of primitivity of a non-negative matrix
- Unzerlegbare, nicht negative Matrizen
- Semisimple commutative algebras with positive bases
- Some remarks on upper bounds for Weierstrass primary factors and their application in spectral theory
- Proof of a conjecture about the exponent of primitive matrices
- A bound on the exponent of a primitive matrix using Boolean rank
- A diameter bound on the exponent of a primitive directed graph
- A bound on the exponent of primitivity in terms of diameter
- A problem on the exponent of primitive digraphs
- On the sequence of power of a stochastic matrix with large exponent
- Maximal exponents of polyhedral cones. I
- Primitive normal matrices and covering numbers of finite groups.
- Maximal exponents of polyhedral cones. III
This page was built for publication: Bounds on the exponent of primitivity which depend on the spectrum and the minimal polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365696)
