Large-determinant sign matrices of order \(4k+1\) (Q864164): Difference between revisions

A sign matrix is an \(n\times n\) matrix with entries \(\pm 1\). The Hadamard maximal determinant problem asks for the largest determinant of an \(n\times n\) sign matrix. As every row has norm \(\sqrt{n}\), an upper bound for the determinant is \(n^{n/2}\). This bound can be attained only if 4 divides \(n\). If \(n=4k+1\), then the determinant cannot exceed the Barba bound \(B(n)=(n-1)^{(n-1)/2}\sqrt{2n-1}\), see \textit{G. Barba} [Giorn. Mat. Battaglini, III. Ser. 71, 70--86 (1933; Zbl 0007.39102)]. \textit{N. Farnakis} and \textit{S. Kounias} [Discrete Math. 67, 165--176 (1987; Zbl 0652.05006)] gave a general method, the maximal excess construction, to construct a sign matrix whose determinant is asymptotically \(B(n)/\sqrt{2}\). For \(n=13,21, 25,41\), and more recently for \(n=29,33,45,53,57,69,77,85, 93\), even better constructions were found. The current paper presents a general construction that accounts for many of the improvements listed, and also improves on the asymptotics of the lower bound, although only in the second term. The construction starts with 3-normalized Hadamard matrices and then adjoins a row and a column.