Sign patterns allowing nilpotence of index 3 (Q884409)

A real square matrix \(M\) is nilpotent if \(M^k\) is the zero matrix for some integer \(k\) (the least \(k\) for which \(M^k=0\) is called the index of nilpotence). Nilpotence can also be characterised by saying that all eigenvalues must be zero. A \((0,\pm 1)\)-matrix is a sign pattern. A sign pattern \(S\) allows nilpotence of index \(k\) if there is some nilpotent matrix \(M\) of index \(k\) such that \(S\) is obtained by dividing each non-zero entry of \(M\) by its absolute value. This paper is concerned with the set \(\mathcal{N}_3\) of sign patterns allowing nilpotence of index at most \(3\). Four methods for constructing matrices in \(\mathcal{N}_3\) are given and a characterisation is provided for order \(3\) matrices in \(\mathcal{N}_3\). If the non-zero entries of a sign pattern are symmetrically placed then their positions define a undirected graph (possibly with loops). One section of the current paper is devoted to describing the matrices in \(\mathcal{N}_3\) which have an associated graph that, when its loops are removed, is a tree.