Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube

DOI10.1006/JCTA.1997.2789zbMath0887.15017OpenAlexW2087009434MaRDI QIDQ1369731

J. Ning

Publication date: 20 October 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2789

zbMATH Keywords

volumeupper boundsimplexGram determinant

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Miscellaneous inequalities involving matrices (15A45)

Related Items (9)

D-optimal Designs for Seven Objects and a Large Number of Weighings ⋮ Recent developments in D-optimal designs ⋮ Recent accomplishments in weighing designs ⋮ An inequality for positive definite matrices with applications to combinatorial matrices ⋮ D-optimal \((0,1)\)-weighing designs for eight objects ⋮ What is known about unit cubes ⋮ D-optimal (0,1)-weighing designs for 10 objects ⋮ Notes on D-optimal designs ⋮ On certain D-optimal spring balance weighing designs

Cites Work

• Theory of optimal designs
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
• Inequalities: theory of majorization and its applications
• Unnamed Item

This page was built for publication: Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube