Mutually unbiased bush-type Hadamard matrices and association schemes

zbMATH Open1325.05184arXiv1412.5297MaRDI QIDQ2517656FDOQ2517656

Authors: H. Kharaghani, Sara Sasani, Sho Suda 

Publication date: 27 August 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: It was shown by LeCompte, Martin, and Oweans in 2010 that the existence of mutually unbiased Hadamard matrices and the identity matrix, which coincide with mutually unbiased bases, is equivalent to that of a $Q$-polynomial association scheme of class four which is both $Q$-antipodal and $Q$-bipartite. We prove that the existence of a set of mutually unbiased Bush-type Hadamard matrices is equivalent to that of an association scheme of class five. As an application of this equivalence, we obtain the upper bound of the number of mutually unbiased Bush-type Hadamard matrices of order $4n^2$ to be $2n-1$. This is in contrast to the fact that the upper bound of mutually unbiased Hadamard matrices of order $4n^2$ is $2n^2$. We also discuss a relation of our scheme to some fusion schemes which are $Q$-antipodal and $Q$-bipartite $Q$-polynomial of class $4$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Symmetric Bush-type generalized Hadamard matrices and association schemes
• Unbiased Hadamard matrices and bases
• On the real unbiased Hadamard matrices
• Unbiased complex Hadamard matrices and bases
• scientific article; zbMATH DE number 3952780

zbMATH Keywords

association schemefusion schemeDeza graphBush-type Hadamard matrixfirst and second eigenmatrixHigman graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Group actions on combinatorial structures (05E18)

Cites Work

• Title not available (Why is that?)
• Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
• Title not available (Why is that?)
• Strongly regular designs of the second kind
• Three-class association schemes
• Rank 5 association schemes and triality
• Title not available (Why is that?)
• Deza graphs: A generalization of strongly regular graph
• Imprimitive cometric association schemes: constructions and analysis
• On the equivalence between real mutually unbiased bases and a certain class of association schemes
• Unbiased complex Hadamard matrices and bases
• On the real unbiased Hadamard matrices

Cited In (10)

• Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
• Some Bush-type Hadamard matrices
• LCD subspace codes
• Bush-type Butson Hadamard matrices
• Linked systems of symmetric group divisible designs of type. II
• Balancedly splittable Hadamard matrices
• Linked systems of symmetric group divisible designs
• Unbiased orthogonal designs
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• Symmetric Bush-type generalized Hadamard matrices and association schemes

This page was built for publication: Mutually unbiased bush-type Hadamard matrices and association schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517656)