General Lower Bounds on Maximal Determinants of Binary Matrices

Electronic Journal Of Combinatorics

Richard P. Brent¹ 

关键词: { -1}-matrices;    lower bounds;    maximal determinant;    D-optimal designs;    Hadamard matrices;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 de Launey and Levin (2010) and, for certain congruence

【 授权许可】

Others