On the computation of maximum minors of Hadamard matrices
An algorithm is proposed to compute the minors of size \(j\) (\(1\leq j\leq n\)) of Hadamard matrices of size \(n\). [See also \textit{C. Koukouvinos, M. Mitrouli}, and \textit{J. Seberry}, Linear Algebra Appl. 330, No. 1--3, 129--147 (2001; Zbl 0981.65056) and \textit{C. Koukouvinos, E. Lappas, M. Mitrouli}, and \textit{J. Seberry}, ibid. 371, 111--124 (2003; Zbl 1028.65047) for the computation of minors of size \(n-j\), \(j=1,2\).] More specifically, the authors are interested in finding the maximal values of the minors. The complexity of the algorithm increases drastically with \(j\). As an example, maximal values for minors of size \(j=5,6,7\) are computed in the case \(n=20\).
scientific article; zbMATH DE number 2117466