Skip to main content
Article thumbnail
Location of Repository

Complex Hadamard Matrices and Strongly Regular Graphs

By Ada Chan

Abstract

Over forty years ago, Goethals and Seidel showed that if the adjacency algebra of a strongly regular graph $X$ contains a Hadamard matrix then $X$ is either of Latin square type or of negative Latin square type. We extend their result to complex Hadamard matrices and find only three additional families of parameters for which the strongly regular graphs have complex Hadamard matrices in their adjacency algebras. Moreover we show that there are only three distance regular covers of the complete graph that give complex Hadamard matrices

Topics: Mathematics - Combinatorics, 05E30
Year: 2011
OAI identifier: oai:arXiv.org:1102.5601
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.5601 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.