General lower bounds on maximal determinants of binary matrices (Q1953493): Difference between revisions

Summary: We give general lower bounds on the maximal determinant of \(n \times n\) \(\{+1,-1\}\)-matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of \textit{W. de Launey} and \textit{D. A. Levin} [SIAM J. Discrete Math. 23, No. 3, 1422--1440 (2009; Zbl 1231.05041)] and, for certain congruence classes of \(n \bmod 4\), the results of \textit{C. Koukouvinos} et al. [Linear Algebra Appl. 330, No. 1--3, 129--147 (2001; Zbl 0981.65056)]. In an Appendix we give a new proof, using Jacobi's determinant identity, of a result of \textit{F. Szöllősi} [Cryptogr. Commun. 2, No. 2, 187--198 (2010; Zbl 1228.05097)] on minors of Hadamard matrices.