On a simplified version of Hadamard's maximal determinant problem
share
Hadamard's maximal determinant problem consists in finding the maximal value of the determinant of a square n× 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.
READ FULL TEXT