Reducible powerful ray pattern matrices (Q1772725): Difference between revisions

A \textit{ray pattern} is a matrix each of whose entries is either \(0\) or a ray in the complex plane of the form \(re^{i\theta}\), where \(\theta\in\mathbb{R} \) and \(r\) runs through all positive real numbers. A ray pattern \(A\) is called \textit{powerful }if for each positive integer \(k\), the matrix \(A^{k}\) is an unambiguously defined ray pattern. A square matrix \(A\) is said to be \textit{reducible} if there is a permutation matrix \(P\) such that \(P^{T}AP= \left[\begin{smallmatrix} A_{11}&A_{12}\\ 0& A_{22}\end{smallmatrix}\right]\). The paper studies reducible powerful ray pattern matrices. More specifically, it establishes some necessary conditions for a reducible ray pattern to be powerful and characterize the powerful ray patterns with nonzero irreducible components. Furthermore, it investigates the structure of the superdiagonal blocks of a powerful ray pattern \(A\) in Frobenious normal form.