Balancedly splittable Hadamard matrices

@article{Kharaghani2019BalancedlySH,
  title={Balancedly splittable Hadamard matrices},
  author={H. Kharaghani and Sho Suda},
  journal={Discret. Math.},
  year={2019},
  volume={342},
  pages={546-561}
}
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. 
4 Citations
Weakly Hadamard diagonalizable graphs
Abstract A matrix is called weakly Hadamard if its entries are from { 0 , − 1 , 1 } and its non-consecutive columns (with some ordering) are orthogonal. Unlike Hadamard matrices, there is a weaklyExpand
Balancedly splittable orthogonal designs and equiangular tight frames
The concept of balancedly splittable orthogonal designs is introduced along with a recursive construction. As an application, equiangular tight frames over the real, complex, and quaternions meetingExpand
Complex Hadamard diagonalisable graphs
In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices.Expand
Hadamard diagonalizable graphs of order at most 36
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\pm1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard matrix and the graphExpand

References

SHOWING 1-10 OF 31 REFERENCES
Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices
TLDR
Doubly regular tournaments and homogeneous tournaments are defined and shown to be equivalent and existence of such a tournament is equivalent to the existence of a skew Hadamard matrix of order n + 1. Expand
On a class of quaternary complex Hadamard matrices
TLDR
A class of regular unit Hadamard matrices whose entries consist of two complex numbers and their conjugates for a total of four complex numbers are introduced and contained in the Bose-Mesner algebra of an association scheme arising from skew Paley matrices. Expand
Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
We extend Hoffman's coclique bound for regular digraphs with the property that its adjacency matrix is normal, and discuss cocliques attaining the inequality. As a consequence, we characterizeExpand
On Hadamard diagonalizable graphs
Of interest here is a characterization of the undirected graphs G such that the Laplacian matrix associated with G can be diagonalized by some Hadamard matrix. Many interesting and fundamentalExpand
Linked systems of symmetric group divisible designs of type II
Linked systems of symmetric group divisible designs of type II are introduced, and several examples are obtained from affine resolvable designs and a variant of mutually orthogonal Latin squares.Expand
The excess problem and some excess inequivalent matrices of order 32
Abstract Let 4 n be the order of an Hadamard matrix. It is shown that there is a regular complex Hadamard matrix of order 8 n 2 . Five classes of excess-inequivalent Hadamard matrices of order 32 areExpand
Linked systems of symmetric group divisible designs
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number ofExpand
3-Class Association Schemes and Hadamard Matrices of a Certain Block Form
TLDR
All Hadamard matrices of this form are constructed in which all blocksHij have rank 1 and Jg = JgHij =-0. Expand
The Weights of Hadamard Matrices
TLDR
Upper and lower bounds for w ( n) are derived for the weight of H to be w ( H ) = number of 1's in H , and w(n) = max {w(H); H ∈ Ω n } . Expand
Strongly regular graphs derived from combinatorial designs
Publisher Summary This chapter explores strongly regular graphs derived from combinatorial designs. It presents graphs that are undirected, without loops, and without multiple edges. It discusses theExpand
...
1
2
3
4
...