On a simplified version of Hadamard's maximal determinant problem

Abstract

Hadamard's maximal determinant problem consists in finding the maximal value of the determinant of a square $n\times n$ matrix whose entries are plus or minus ones. This is a difficult mathematical problem which is not yet solved. In the present paper a simplified version of the problem is considered and studied numerically.

AmSTeX, 6 pages, amsppt style

Cited by in corpus (2)

• Hadamard matrices in $\{0,1\}$ presentation and an algorithm for generating them
• Pseudo-Hadamard matrices of the first generation and an algorithm for producing them