English

Isomorphism classes of association schemes induced by Hadamard matrices

Combinatorics 2015-03-10 v2

Abstract

Every Hadamard matrix HH of order n>1n > 1 induces a graph with 4n4n vertices, called the Hadamard graph Γ(H)\Gamma(H) of HH. Since Γ(H)\Gamma(H) is a distance-regular graph with diameter 44, it induces a 44-class association scheme (Ω,S)(\Omega, S) of order 4n4n. In this article we deal with fission schemes of (Ω,S)(\Omega, S) under certain conditions, and for such a fission scheme we estimate the number of isomorphism classes with the same intersection numbers as the fission scheme.

Keywords

Cite

@article{arxiv.1407.7346,
  title  = {Isomorphism classes of association schemes induced by Hadamard matrices},
  author = {Mitsugu Hirasaka and Kijung Kim and Hyonju Yu},
  journal= {arXiv preprint arXiv:1407.7346},
  year   = {2015}
}

Comments

12 pages