Scholarlink

<p>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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(HH^{\dagger } = nI\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>H</mi> <msup> <mi>H</mi> <mo>†</mo> </msup> <mo>=</mo> <mi>n</mi> <mi>I</mi> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(H^{\dagger }\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>H</mi> <mo>†</mo> </msup> </math></EquationSource> </InlineEquation> is the conjugate transpose of <i>H</i>. 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. </p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Equivalence of complex Hadamard matrices

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月28日

查看全文
  • Patric R. J. Östergård,
  • Tuomo Valtonen

摘要

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^{\dagger } = nI\) H H † = n I , where \(H^{\dagger }\) 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.