Reducible pattern k-potent ray pattern matrices
An \(n \times n \) ray pattern is the set of all \(n \times n \) complex matrices with a specified zero-nonzero pattern and with the argument specified for each nonzero entry. A ray pattern \(A\) is said to be pattern \(k\)-potent if \(k\) is the smallest positive integer such that \(A^{k+1} = A\) as ray patterns. The author extends some results of \textit{J. Stuart}, \textit{L. Beasley} and \textit{B. Shader} [Linear Algebra Appl. 346, No. 1--3, 261--271 (2002; Zbl 0998.15030)] to the reducible ray patterns and supplies his article with interesting examples.
- Irreducible, pattern \(k\)-potent ray pattern matrices
- Reducible powerful ray pattern matrices
- Periodic, reducible, powerful ray pattern matrices
- Irreducible powerful ray pattern matrices
- Periodic, irreducible, powerful ray pattern matrices
- On reducible matrix patterns
- Reducible sign \(k\)-potent sign pattern matrices
- Ray pattern matrices requiring Perron-Frobenius properties
- Ray patterns of matrices and nonsingularity
- Irreducible sign k-potent sign pattern matrices
- Sign \(k\)-potent sign patterns and ray \(k\)-potent ray patterns that allow \(k\)-potence
- Reducible sign \(k\)-potent sign pattern matrices
- Irreducible powerful ray pattern matrices
- Irreducible, pattern \(k\)-potent ray pattern matrices
- Reducible powerful ray pattern matrices
- Sign \(k\)-potent sign patterns and ray \(k\)-potent ray patterns that admit \(k\)-potence
- Periodic, reducible, powerful ray pattern matrices
- The period and base of a reducible sign pattern matrix
- Periodic, irreducible, powerful ray pattern matrices
- A survey on bases of sign pattern matrices
This page was built for publication: Reducible pattern \(k\)-potent ray pattern matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863568)
