The number of invariant polynomials of a matrix with prescribed off-diagonal blocks (Q1359182): Difference between revisions

Let \(A=\left[\begin{matrix} A_{1,1}&A_{1,2}\\A_{2,1}&A_{2,2}\end{matrix}\right]\) be an \(n\times n\) matrix over a field \(F\), and let \(p_{1},p_{2}>0\) be integers such that \(n=p_{1}+p_{2}\) and \(A_{i,j}\) is a \(p_{i}\times p_{j}\) matrix, \(i,j=1,2\). Suppose \(A_{1,2}\) and \(A_{2,1}\) are fixed, set \(t=\max\{\text{rank } A_{1,2},\text{rank} A_{2,1}\}\), and let \(\tau\) be an integer. Then there exist \(A_{1,1}\) and \(A_{2,2}\) such that \(\tau\) is the number of nontrivial invariant polynomials of \(A\) if and only if \(1\leq\tau\leq n-t\). The result follows the direction of research outlined by \textit{G. N. de Oliveira} [Linear Multilinear Algebra 2, 357-364 (1975; Zbl 0302.15014)].