Symmetric conference matrices and locally largest regular crosspolytopes in cubes

DOI10.1016/S0024-3795(02)00358-0zbMath1015.05020MaRDI QIDQ1855403

Asa Packer

Publication date: 5 February 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Hadamard matricesproblem of containment

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unsolved problems in geometry
• On the complexity of some basic problems in computational convexity. I. Containment problems
• The structure of weighing matrices having large weights
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
• Large Growth Factors in Gaussian Elimination with Pivoting
• On Growth in Gaussian Elimination with Complete Pivoting
• Orthogonal Matrices with Zero Diagonal. II