Zero-one matrices with an application to abelian groups (Q1315163): Difference between revisions

An \(n \times n\) matrix \(E\) is called a \(0,1\)-matrix if each entry of \(E\) is either 0 or 1. Then \(E\) can be viewed as a matrix over \(\mathbb{Z}_ 2\). A \(0,1\)-matrix is admissible if \(\text{det } E_ k \neq 0\) for each \(k\), where \(E_ k\) arises from \(E\) by replacing its \(k\)th column by the vector \(\mathbf{1}\) containing only 1's. In the first part of their paper the authors study some properties of admissible matrices and determine the number of admissible matrices over \(\mathbb{Z}_ 2\). L. Fuchs and C. Metelli used admissible matrices to classify a certain class of Butler groups, the so-called \(B(1)\)-groups. Using their results on admissible matrices the authors are able to give an upper bound for the number of nonequivalent representation types of a \(B(1)\)-group.