Classification of Hadamard matrices of order 28 with Hall sets (Q1322188)

A Hadamard matrix of order \(n\) is an \(n \times n\) matrix of 1's and --1's with \(H \cdot H^ T=nE\). Two Hadamard matrices \(H_ 1\), \(H_ 2\) are equivalent if there exists a signed permutation \(g\) of rows and columns of \(H_ 1\) with \(H_ 1g=H_ 2\). A Hadamard matrix is called normalized if its last row and column consist entirely of 1's. Let \(H\) be a Hadamard matrix of order \(n=8k+4\), \(k>2\), which is normalized. It is said that \(H\) has a Hall set if \(H\) has a submatrix which is equivalent to the following form: \[ \left[ \begin{matrix} J_{2k} & J_{2k} & -J_{2k} & -J_{2k} & + - - + \\ J_{2k} & -J_{2k} & J_{2k} & -J_{2k} & - + - + \\ -J_{2k} & J_{2k} & J_{2k} & - J_{2k} & - - + + \\ J_{2k} & J_{2k} & J_{2k} & J_{2k} & + + + + \end{matrix} \right] \] where \(J_{2k}\) is a \(2k\)-dimensional row vector of 1's. The author gives a method for a classification of Hadamard matrices and completely classifies the matrices of order 28 with Hall sets. There exist exactly 486 inequivalent matrices of order 28 with Hall sets and only five matrices in [the author, Hokkaido Math. J. 17, No. 1, 139-146 (1988; Zbl 0694.05018)] have the same \(K\)-matrix [the author and \textit{H. Ohmori}, Mem. Fac. Ed. Ehime Univ. Natur. Sci. 7, 7-57 (1987)].