Combinatorial Matrices with Small Determinants

From MaRDI portal





The problem considered here is that of \( \operatorname{determining} \min |\operatorname{det}(A)| \), where \( A \) ranges over all \( n \times n \) nonsingular incidence matrices with common row and column sum \( k \), or over all nonsingular \( n \times n \) matrices with elements \(\pm 1\). It is shown for example that the answer to the first problem is \( k \) when \( (n, k)=1 \), and \( k^{2} \) when \( k \) divides \( n \) and \( n>2 k \), prompting the conjecture that it is always \( k(n, k) \). It is also shown that the answer to the second problem is \( 2^{n-1} \). An interesting related result is that an \( n \times n \) nonsingular incidence matrix with common row and column sum \( k \) always exists, except when \( n=k>1 \), and \( n=4, k=2 \).












This page was built for publication: Combinatorial Matrices with Small Determinants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168718)