On the almost-principal minors of a symmetric matrix

From MaRDI portal
Publication:2199354



Abstract: The almost-principal rank characteristic sequence (apr-sequence) of an nimesn symmetric matrix is introduced, which is defined to be the string a1a2cdotsan−1, where ak is either tA, tS, or tN, according as all, some but not all, or none of its almost-principal minors of order k are nonzero. In contrast to the other principal rank characteristic sequences in the literature, the apr-sequence of a matrix does not depend on principal minors. The almost-principal rank of a symmetric matrix B, denoted by maprank(B), is defined as the size of a largest nonsingular almost-principal submatrix of B. A complete characterization of the sequences not containing an tA that can be realized as the apr-sequence of a symmetric matrix over a field mathbbF is provided. A necessary condition for a sequence to be the apr-sequence of a symmetric matrix over a field mathbbF is presented. It is shown that if BinmathbbFnimesn is symmetric and non-diagonal, then mrank(B)−1leqmaprank(B)leqmrank(B), with both bounds being sharp. Moreover, it is shown that if B is symmetric, non-diagonal and singular, and does not contain a zero row, then mrank(B)=maprank(B).


A square submatrix of a matrix is \emph{almost principal} if it is induced by the rows with indices in a set \(R\) and columns with indices in a set \(C\) satisfying \(|R\setminus C|=|C\setminus R|=1\). An \emph{almost principal minor} is the determinant of an almost principal submatrix. The \emph{almost-principal rank} of a symmetric matrix \(B\), denoted by ap-rank\((B)\), is the order of a largest nonsingular almost-principal submatrix of \(B\). This paper introduces the almost-principal rank characteristic sequence (\emph{apr-sequence}) of an \(n\times n\) symmetric matrix over an arbitrary field. It is defined to be the string \(a_1a_2\cdots a_{n-1}\) in which \(a_k\) is `A', `S', or `N', according to whether all, some but not all, or none of its almost-principal minors of order \(k\) are nonzero. One of the main results is a characterization of the sequences not containing an `A' that can be realized as the apr-sequence of a symmetric matrix. A necessary condition for a sequence containing `A' to be the apr-sequence of a symmetric matrix is given. It is also proved that if \(B\) is symmetric and non-diagonal, then rank\((B)-1\le\)~ap-rank\((B)\le\)~rank\((B)\). Moreover, if \(B\) is symmetric, non-diagonal and singular and does not contain a zero row, then rank\((B) = \)ap-rank\((B)\).











This page was built for publication: On the almost-principal minors of a symmetric matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199354)