Balancedly splittable Hadamard matrices

DOI10.1016/j.disc.2018.10.021zbMath1400.05040arXiv1806.00165OpenAlexW2963525585WikidataQ128943679 ScholiaQ128943679MaRDI QIDQ1625818

Hadi Kharaghani, Sho Suda

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00165

zbMATH Keywords

association schemestrongly regular graphHadamard matrixHadamard diagonalizable graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30)

Related Items (7)

Hadamard diagonalizable graphs of order at most 36 ⋮ Complex Hadamard diagonalisable graphs ⋮ Hadamard matrices related to projective planes ⋮ Constructions and restrictions for balanced splittable Hadamard matrices ⋮ Weakly Hadamard diagonalizable graphs ⋮ Balancedly splittable orthogonal designs and equiangular tight frames ⋮ Linked systems of symmetric group divisible designs of type. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hadamard diagonalizable graphs
• Spectra of graphs
• On the equivalence between real mutually unbiased bases and a certain class of association schemes
• Subschemes of the Johnson scheme
• Spherical codes and designs
• 3-class association schemes and Hadamard matrices of a certain block form
• The excess problem and some excess inequivalent matrices of order 32
• On a class of quaternary complex Hadamard matrices
• Linked systems of symmetric group divisible designs
• Mutually unbiased bush-type Hadamard matrices and association schemes
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Hadamard's determinant theorem and the sum of four squares
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Mutually Unbiased Biangular Vectors and Association Schemes
• Bounds on mixed binary/ternary codes
• Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes
• Strongly Regular Graphs Derived from Combinatorial Designs
• On a problem of K. A. Bush concerning Hadamard matrices

This page was built for publication: Balancedly splittable Hadamard matrices