Bounds on minors of binary matrices
From MaRDI portal
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Determinants, permanents, traces, other special matrix functions (15A15) Boolean and Hadamard matrices (15B34)
Abstract: We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is simpler. We give several corollaries relevant to minors of Hadamard matrices, and generalise a result of Turan on determinants of random {+1,-1} matrices.
Recommendations
Cites work
- \((1,-1)\)-matrices with near-extremal properties
- An algorithm to find formulae and values of minors for Hadamard matrices
- An algorithm to find formulae and values of minors for Hadamard matrices. II
- Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
- Exotic complex Hadamard matrices and their equivalence
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- On random ±1 matrices: Singularity and determinant
Cited in
(4)
This page was built for publication: Bounds on minors of binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865131)