z-logo
Premium
HADAMARD MATRICES AND 1‐FACTORIZATIONS OF COMPLETE GRAPHS
Author(s) -
Ball Keith,
OrtegaMoreno Oscar,
Prodromou Maria
Publication year - 2019
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579318000566
Subject(s) - hadamard transform , mathematics , complex hadamard matrix , hadamard matrix , hadamard's inequality , combinatorics , hadamard's maximal determinant problem , hadamard three lines theorem , matrix (chemical analysis) , factorization , discrete mathematics , algorithm , mathematical analysis , materials science , composite material
We discuss 1‐factorizations of complete graphs that “match” a given Hadamard matrix. We prove the existence of these factorizations for two families of Hadamard matrices: Walsh matrices and certain Paley matrices.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here