On Nonnegative matrices generating a finite multiplicative monoid
From MaRDI portal
The author investigates square nonnegative matrices with the property that the set of powers of the matrix (the multiplicative monoid) is a finite set by a detailed analysis of the Jordan form of the matrix. Several criteria for the finiteness of the monoid is given and applied to the study of non-negative matrix solutions to the equations \(A^ k=0\), \(A^ k=I\), \(A^ k=A\) and \(A^ k=A^ T\).
Recommendations
Cites work
- Depth-First Search and Linear Graph Algorithms
- Group inverses of certain nonnegative matrices
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- Nonnegative \lambda -Monotone Matrices
- Nonnegative matrices generating a finite cyclic group
- Nonnegative mth roots of nonnegative 0-symmetric idempotent matrices
- On finite semigroups of matrices
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
- On the periodicity of the graph of nonnegative matrices
- Simultaneous equations models in applied search theory
Cited in
(7)- On a transport problem and monoids of non-negative integers
- On the monotonicity of the number of positive entries in nonnegative five-element matrix powers
- scientific article; zbMATH DE number 978080 (Why is no real title available?)
- On Nonnegative Integer Matrices and Short Killing Words
- On finite monoids over nonnegative integer matrices and short killing words
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
- On polynomial matrix equations XT=p(X) and X=p(X) Where all parameters are nonnegative
This page was built for publication: On Nonnegative matrices generating a finite multiplicative monoid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978322)
