Implementing Hadamard Matrices in SageMath
Matteo Cati, Dmitrii V. Pasechnik

TL;DR
This paper presents an implementation of Hadamard and skew Hadamard matrices in SageMath, enabling verification and construction of these matrices for all known orders up to 1000, including additional related mathematical objects.
Contribution
The authors developed SageMath implementations for constructing and verifying Hadamard and skew Hadamard matrices up to order 1000, including new tools for related objects like difference sets.
Findings
Successfully constructed all known Hadamard matrices up to order 1000.
Identified and corrected an error in the claimed construction for order 292.
Provided tools for verifying existence and construction of Hadamard matrices.
Abstract
Hadamard matrices are square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order exist whenever is , , or a multiple of . However, no construction is known that works for all values of , and for some orders no Hadamard matrix has yet been found. Given the many practical applications of these matrices, it would be useful to have a way to easily check if a construction for a Hadamard matrix of order exists, and in case to create it. This project aimed to address this, by implementing constructions of Hadamard and skew Hadamard matrices to cover all known orders less than or equal to in SageMath, an open-source mathematical software. Furthermore, we implemented some additional mathematical objects, such as complementary difference sets and T-sequences, which were not present in SageMath but are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications
