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× 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.