Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
From MaRDI portal
Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
chemical balancesHadamard determinant problemHadamard matriceslargest simplexoptimal weighting designsspring balancessurvey paper
Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02) Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
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.
Recommendations
Cites work
- \(A\)-optimization of exact first-order saturated designs for \(N\equiv 1\mod 4\) observations
- A \(D\)-optimal design of order 102
- A construction for maximal $\left( { + 1, - 1} \right)$-matrix of order $54$
- A construction method of new \(D\)-, \(A\)-optimal weighing designs when \(N\equiv 3\bmod 4\) and \(k\leq N-1\)
- A construction of D-optimal designs for N 2 mod 4
- A construction of D-optimal weighing designs when n 3 mod 4
- A construction of Hadamard matrices
- A Hadamard matrix of order 268
- A Sequence of (± 1)-Determinants with Large Values
- A-optimal weighing designs when N\(\equiv 3(mod\,4)\)
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An application of the Kiefer-Wolfowitz equivalence theorem to a problem in Hadamard transform optics
- Codes and designs
- Comparison of designs equivalent under one or two criteria
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Computational complexity of norm-maximization
- Computer Construction of "D-Optimal" First-Order Designs
- Construction methods for D-optimum weighing designs when n=3(mod 4)
- Construction of D-optimal designs for \(N\equiv 2\,mod\,4\) using block-circulant matrices
- D-optimal weighing designs and optimal chemical balance weighing designs for estimating the total weight
- D-optimum weighing designs
- Deciding uniqueness in norm maximazation
- Determinantenabschätzung für binäre Matrizen mit \(n\equiv 3\bmod 4\)
- Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
- Determinants of matrices of the conference type
- Determinants Whose Elements Are 0 and 1
- Determinants with Elements ± 1
- Distance geometry notes
- Doubly Lexical Orderings of Matrices
- Einlagerung des regulären n-Simplex in den \(n\)-dimensionalen Würfel
- Enumeration of Symmetric Designs (25,9,3)
- Growth in Gaussian Elimination
- Hadamard Matrices and Some Generalisations
- Hadamard matrices and their applications
- Hadamard matrices and their applications
- How Many Degenerate Simplices are Generated by n + 1 Vertices of th Unit n-Cube?
- scientific article; zbMATH DE number 444349 (Why is no real title available?)
- scientific article; zbMATH DE number 3872174 (Why is no real title available?)
- scientific article; zbMATH DE number 4137779 (Why is no real title available?)
- scientific article; zbMATH DE number 3965243 (Why is no real title available?)
- scientific article; zbMATH DE number 3967306 (Why is no real title available?)
- scientific article; zbMATH DE number 4021231 (Why is no real title available?)
- scientific article; zbMATH DE number 3723724 (Why is no real title available?)
- scientific article; zbMATH DE number 3728998 (Why is no real title available?)
- scientific article; zbMATH DE number 11979 (Why is no real title available?)
- scientific article; zbMATH DE number 124523 (Why is no real title available?)
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- scientific article; zbMATH DE number 3521387 (Why is no real title available?)
- scientific article; zbMATH DE number 3522990 (Why is no real title available?)
- scientific article; zbMATH DE number 3637895 (Why is no real title available?)
- scientific article; zbMATH DE number 515358 (Why is no real title available?)
- scientific article; zbMATH DE number 665697 (Why is no real title available?)
- scientific article; zbMATH DE number 745236 (Why is no real title available?)
- scientific article; zbMATH DE number 222417 (Why is no real title available?)
- scientific article; zbMATH DE number 3217531 (Why is no real title available?)
- scientific article; zbMATH DE number 3234447 (Why is no real title available?)
- scientific article; zbMATH DE number 3256523 (Why is no real title available?)
- scientific article; zbMATH DE number 3271295 (Why is no real title available?)
- scientific article; zbMATH DE number 3308316 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- scientific article; zbMATH DE number 3187645 (Why is no real title available?)
- scientific article; zbMATH DE number 3103173 (Why is no real title available?)
- Jung's constant for the space \(L_ p\)
- Largest \(j\)-simplices in \(n\)-polytopes
- Lower Bounds for Maximal (0,1)-Determinants
- Maximal Binary Matrices and Sum of Two Squares
- Maximal Determinants In Combinatorial Investigations
- Maximum determinants of complementary acyclic matrices of zeros and ones
- On Designs of Maximal (+1, -1)-Matrices of Order n ≡2 (mod 4)
- On Designs of Maximal (+1, -1)-Matrices of Order n ≡2 (mod 4). II
- On Determinants with Elements ±1, II
- On Hadamard's inequality for the determinants of order non-divisible by 4
- On Hotelling's Weighing Problem
- On Maximal Regular Polyhedra Inscribed in a Regular Polyhedron
- On maximizing det (A\(^T\)A)
- On maximizing detXtX
- On Orthogonal Matrices
- On some extremal simplexes
- On the Design of Experiments for Weighing and Making Other Types of Measurements
- On the number of \(D\)-optimal designs
- On the optimality of chemical balance weighing designs
- On the optimality of spring balance weighing designs
- On the Probability That a Random ± 1-Matrix Is Singular
- On the Value of Determinants
- Optimality aspects of 3-concurrence most balanced designs
- Optimality of some weighing and \(2^n\) fractional factorial designs
- OPTIMUM SINGULAR SPRING BALANCE WEIGHING DESIGNS WITH NON-HOMOGENEITY OF THE VARIANCES OF ERRORS FOR ESTIMATING THE TOTAL WEIGHT
- Orthogonal Matrices with Zero Diagonal
- Orthogonal Matrices with Zero Diagonal. II
- Regular Compound Polytopes in More Than Four Dimensions
- Regular Simplices and Quadratic Forms
- Regular Simplices with Rational Vertices
- Some Aspects of Weighing Designs
- Some D-optimal weighing designs for n=3 (mod 4)
- Some Designs for Maximal (+1, -1)-Determinant of Order n ≡2 (mod 4)
- Some Improvements in Weighing and Other Experimental Techniques
- Some Optimum Weighing Designs
- Supplementary difference sets and D-optimal designs for n 2 mod 4
- Supplementary difference sets and optimal designs
- The content of some extreme simplexes
- The coordinex problem and its relation to the conjecture of Wilkinson
- The exact D-optimal first order saturated design with 17 observations
- The existence of symmetric block designs with parameters \((41,16,6)\) and \((66,26,10)\)
- The Hadamard Maximum Determinant Problem
- The maximum determinant of 21\(\times 21\) \((+1,-1)\)-matrices and D-optimal designs
- The maximum determinant of \(\pm 1\) matrices
- The non-equivalent circulant D-optimal designs for n 2 4, n 54, n=66
- The Sequential Generation of D-Optimum Experimental Designs
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- Two new D-optimal designs (83,56,12), (83,55,12)
- Unsolved problems in geometry
- Zwei Extremalprobleme der Minkowski-Geometrie
Cited in
(30)- Large regular simplices contained in a hypercube
- Covering and packing problems in lattices associated with the \(n\)-cube
- Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- Computing efficient exact designs of experiments using integer quadratic programming
- Perfect simplices in \({\mathbb R}^5\)
- The minimal volume of simplices containing a convex body
- Recursivity and geometry of the hypercube
- Notes on D-optimal designs
- Symmetric conference matrices and locally largest regular crosspolytopes in cubes
- Largest \(j\)-simplices in \(n\)-polytopes
- On certain D-optimal spring balance weighing designs
- A note on optimal point distributions in \([0,1)^{s}\)
- Trace-minimal graphs and D-optimal weighing designs
- Some properties of 0/1-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
- Computing maximal copies of polyhedra contained in a polyhedron
- On largest volume simplices and sub-determinants
- Linear interpolation on a Euclidean ball in \(\mathbb{R}^n\)
- Regular D-optimal spring balance weighing designs with correlated errors
- Estimation of interpolation projectors using Legendre polynomials
- Approximation of convex bodies by inscribed simplices of maximum volume
- The trace-minimal graph with \(2v\) vertices and regularity \(v+1\)
- D-optimal \((0,1)\)-weighing designs for eight objects
- Minimal zonotopes containing the crosspolytope
This page was built for publication: Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923163)
