Abstract: Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are presented. As an application, commutative association schemes of 4, 5, and 6 classes are constructed.
Recommendations
Cites work
- 3-class association schemes and Hadamard matrices of a certain block form
- Bounds on mixed binary/ternary codes
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- Hadamard's determinant theorem and the sum of four squares
- Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 5127191 (Why is no real title available?)
- scientific article; zbMATH DE number 3935054 (Why is no real title available?)
- scientific article; zbMATH DE number 3492731 (Why is no real title available?)
- scientific article; zbMATH DE number 3611378 (Why is no real title available?)
- Linked systems of symmetric group divisible designs
- Mutually Unbiased Biangular Vectors and Association Schemes
- Mutually unbiased bush-type Hadamard matrices and association schemes
- On a class of quaternary complex Hadamard matrices
- On a problem of K. A. Bush concerning Hadamard matrices
- On Hadamard diagonalizable graphs
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- On the real unbiased Hadamard matrices
- Spectra of graphs
- Spherical codes and designs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Subschemes of the Johnson scheme
- The excess problem and some excess inequivalent matrices of order 32
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(8)- Balancedly splittable orthogonal designs and equiangular tight frames
- Hadamard diagonalizable graphs of order at most 36
- Complex Hadamard diagonalisable graphs
- Weakly Hadamard diagonalizable graphs
- Linked systems of symmetric group divisible designs of type. II
- Constructions and restrictions for balanced splittable Hadamard matrices
- Hadamard matrices related to projective planes
- Spherical codes attached to complex weighing matrices
This page was built for publication: Balancedly splittable Hadamard matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625818)
