On the monotonicity of the number of positive entries in nonnegative five-element matrix powers
Nonnegative matrices are matrices with nonnegative real entries. They find applications in many fields, such as probability, economics, and combinatorics. The authors define $F$ to be a function from the nonnegative square matrices to the integers that counts the number of positive entries in nonnegative square matrices. They study those conditions on an $m\times m$ square matrix $A$ with nonnegative entries to make the sequence $\{F(A^n)\}$ monotonic. The monotonicity is derived for $F(A)\leq 4$ (except three non-monotonic cases) and $F(A)\geq m^2-2m+2$. The authors extend this results to $F(A) = 5$.
- On the monotonicity of the number of positive entries in nonnegative four element matrix powers
- Monotonicity of the number of positive entries in nonnegative matrix powers
- An alternate proof of the monotonicity of the number of positive entries in nonnegative matrix powers
- Functions of matrices with nonnegative entries
- On Nonnegative matrices generating a finite multiplicative monoid
- Functions of matrices with nonnegative entries
- An alternate proof of the monotonicity of the number of positive entries in nonnegative matrix powers
- On the monotonicity of the number of positive entries in nonnegative four element matrix powers
- Monotonicity of the number of positive entries in nonnegative matrix powers
This page was built for publication: On the monotonicity of the number of positive entries in nonnegative five-element matrix powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238489)