Maximal j-simplices in the real d-dimensional unit cube
Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube
The authors investigate the maximal volume of a \(j\)-simplex spanned by \(j\) vertices of the unit cube and the origin in real \(d\)-dimensional space. \textit{M. Hudelson}, \textit{V. Klee} and \textit{D. Larman} [Linear Algebr. Appl. 241-243, 519-598 (1996; Zbl 0861.15004)] established an upper bound for that volume; for \(j\) odd and specific values of \(d\) that bound is attained, whereas for \(j\) even that bound is not attainable. In the present paper the above mentioned result is improved by giving an upper bound for \(j\) even which is attained for infinitely many values of \(d\). Moreover, the cases \(j=2\) and \(j=3\) are discussed in detail.
- An inequality for positive definite matrices with applications to combinatorial matrices
- Notes on D-optimal designs
- Largest \(j\)-simplices in \(n\)-polytopes
- Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
- On certain D-optimal spring balance weighing designs
- Maximal dimension of unit simplices
- D-optimal Designs for Seven Objects and a Large Number of Weighings
- What is known about unit cubes
- Recent developments in D-optimal designs
- Recent accomplishments in weighing designs
- D-optimal (0,1)-weighing designs for 10 objects
- Regular D-optimal spring balance weighing designs with correlated errors
- D-optimal \((0,1)\)-weighing designs for eight objects
This page was built for publication: Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369731)
