Complex Hadamard matrices and strongly regular graphs
Discrete Mathematics · 2026-11 · 349 (11) · 115297
DOI: 10.1016/j.disc.2026.115297 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-11. Verfasst von Ada Chan. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
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.
Förderung
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Chan, A. (2026). Complex Hadamard matrices and strongly regular graphs. Discrete Mathematics, 349(11), 115297. https://doi.org/10.1016/j.disc.2026.115297
Vancouver
Chan A. Complex Hadamard matrices and strongly regular graphs. Discrete Mathematics. 2026;349(11):115297. doi:10.1016/j.disc.2026.115297
BibTeX
@article{Chan2026,
author = {Chan, Ada},
title = {Complex Hadamard matrices and strongly regular graphs},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {11},
pages = {115297},
doi = {10.1016/j.disc.2026.115297}
}
EUVIMED