Switching operations for Hadamard matrices
William P. Orrick
Abstract
We define several operations that switch substructures of Hadamard matrices thereby producing new, generally inequivalent, Hadamard matrices. These operations have application to the enumeration and classification of Hadamard matrices. To illustrate their power, we use them to greatly improve the lower bounds on the number of equivalence classes of Hadamard matrices in orders 32 and 36 to 3,578,006 and 18,292,717.
Create a lesson
Related papers
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla et al.
Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman