The Hadamard Maximum Determinant Problem

DOI10.2307/2317092zbMath0249.15003OpenAlexW4239426483MaRDI QIDQ5661654

J. L. Brenner, Larry J. Cummings

Publication date: 1972

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2317092

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45)

Related Items

On the complexity of some basic problems in computational convexity. I. Containment problems, Covering and packing problems in lattices associated with the \(n\)-cube, Maximal determinants of combinatorial matrices, The maximum determinant of \(\pm 1\) matrices, Maximum determinants of complementary acyclic matrices of zeros and ones, Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem, The weights of Hadamard matrices, Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations, On \(\alpha\)-roughly weighted games, Sparse weighted voting classifier selection and its linear programming relaxations, Weighted Fekete points on the real line and the unit circle, Measuring a linear approximation to weakly nonlinear MIMO systems, Zero-sum-free tuples and hyperplane arrangements, Threshold circuit lower bounds on cryptographic functions, What is known about unit cubes, Determinant Optimization on Binary Matrices, Extremal problems for polynomials with real roots, Simplexity of the cube, Cluster partitions and fitness landscapes of the Drosophila fly microbiome, On a sequence of random distance graphs subject to the zero-one law, Maximal Binary Matrices and Sum of Two Squares, On maximizing det (A\(^T\)A), Sir Thomas Muir, 1844--1934, Optimal Weighing Designs, Zero-one laws for random graphs with vertices in a Boolean cube, Some outstanding problems in the theory of matrices