Metraipolis › archive › dc_ebd2c85ea492
Equivalence of Complex Hadamard Matrices — arXiv:2609.21653
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21653
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:10:31.838Z
- SHA-256 of the archived text
5285ad087ec9e9a3c0b37f0276cd91c26b2db7d8a6676bdc93de2a109c0dc17d- Stable URL of this page
https://metraipolis.com/documento/dc_ebd2c85ea492
How to cite
Equivalence of Complex Hadamard Matrices — arXiv:2609.21653 — arXiv (en), https://arxiv.org/abs/2609.21653 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ebd2c85ea492 (Metraipolis archive dc_ebd2c85ea492, sha256 5285ad087ec9e9a3c0b37f0276cd91c26b2db7d8a6676bdc93de2a109c0dc17d)
BibTeX
@misc{dcebd2c85ea492,
title = {Equivalence of Complex Hadamard Matrices — arXiv:2609.21653},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21653},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ebd2c85ea492; sha256 5285ad087ec9e9a3c0b37f0276cd91c26b2db7d8a6676bdc93de2a109c0dc17d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21653. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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$, where $H^{\dagger}$ 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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.21653 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:48:20.601Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).