Equivalence of Complex Hadamard Matrices

@misc{ostergard2026equivalence,
  title = {{Equivalence of Complex Hadamard Matrices}},
  author = {Patric R. J. Östergård and Tuomo Valtonen},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.21653},
  eprint = {2609.21653},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.21653},
}

TY  - UNPB
TI  - Equivalence of Complex Hadamard Matrices
AU  - Patric R. J. Östergård
AU  - Tuomo Valtonen
PY  - 2026
DA  - 2026/09/18
PB  - arXiv
DO  - 10.48550/arxiv.2609.21653
UR  - https://arxiv.org/abs/2609.21653
AB  - Symmetry in the context of equivalence or isomorphism is a fundamental and natural concept in any study of discrete structures. Symmetries are also important for non-discrete structures, but their treatment can be more challenging and is perhaps therefore often overlooked. This holds for many studies of complex Hadamard matrices, that is, matrices with unimodular complex entries satisfying the equation HH^† = nI, where H^† is the conjugate transpose of H. In the current work, equivalence of complex Hadamard matrices is considered, and algorithms for determining equivalence of matrices and the automorphism group of a matrix are presented. The algorithms are used to establish the automorphism group of a large number of complex Hadamard matrices from the literature.
ER  -