Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163)

The problem of finding a largest \(j\)-dimensional simplex in a given \(d\)-dimensional cube is studied in this nicely presented survey paper. When \(j=d\), this problem is equivalent to the Hadamard determinant problem which is quite old and has been solved for infinitely many values of \(d\) but not for \(d= 14\). This problem also subsumes the famous problem on the existence of Hadamard matrices when \(j=d\equiv 3\pmod 4\). The authors study this problem from a geometric point of view. With this approach they solve the problem completely for \(j=2\) and \(j= 3\) (for all \(d)\). They also state a lot of new problems and conjectures and explain the relationship of this problem with \(D\)-optimal weighting designs for chemical balances and spring balances.