Location of Repository

The 2-Transitive Complex Hadamard Matrices

By G. Eric Moorhouse

Abstract

We determine all possibilities for a complex Hadamard matrix H admitting an automorphism group which permutes 2-transitively the rows of H. Our proof of this result relies on the classification theorem for finite 2-transitive permutation groups, and thereby also on the classification of finite simple groups

Topics: 2-transitive, distance regular graph, cover of complete bipartite graph
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.4884
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://math.uwyo.edu/~moorhous... (external link)
  • Suggested articles


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