arXiv Analytics

Sign in

arXiv:1208.1805 [math.CO]AbstractReferencesReviewsResources

General lower bounds on maximal determinants of binary matrices

Richard P. Brent, Judy-anne H. Osborn

Published 2012-08-09, updated 2013-04-14Version 6

We give general lower bounds on the maximal determinant of n by 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 classes of n mod 4, those of Koukouvinos, Mitrouli and Seberry (2000). In an Appendix we give a new proof, using Jacobi's determinant identity, of a result of Sz\"oll\H{o}si (2010) on minors of Hadamard matrices.

Comments: 15 pages, 37 references, 1 table. Typos corrected and theorems renumbered in v6
Journal: The Electronic Journal of Combinatorics 20(2), 2013, #P15
Categories: math.CO, math.ST, stat.TH
Subjects: 05B20, 15A15, 15B34, 62K05
Related articles: Most relevant | Search more
arXiv:1208.3330 [math.CO] (Published 2012-08-16, updated 2012-09-14)
Bounds on minors of binary matrices
arXiv:1501.06235 [math.CO] (Published 2015-01-26)
Probabilistic lower bounds on maximal determinants of binary matrices
arXiv:1402.6817 [math.CO] (Published 2014-02-27, updated 2015-01-26)
Lower bounds on maximal determinants of binary matrices via the probabilistic method