OpenAlex ·
Recent progress in the construction of Hadamard matrices
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.27175
- Original
- Read it at the publisher
- Topics
Abstract
A Hadamard matrix is a square matrix with entries $\pm 1$ whose rows are mutually orthogonal. Hadamard matrices are conjectured to exist at every order divisible by $4$; for approximately the last twenty years, the smallest open case of this conjecture was order 668. In August 2026, Alpöge, Voinov and Reynolds-Haertle announced Hadamard matrices at the twelve orders below $2000$ at which none was known. In this paper we verify and analyse the claimed matrices. We survey results on the existence of Hadamard matrices and list the $95$ orders up to $10\,000$ at which no Hadamard matrix is currently known. In pursuing this work we constructed Hadamard matrices at sixteen orders that were open in the published literature. We conclude with a list of open problems.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Artificial Intelligence
A simplified proof of the FPRAS for counting perfect matchings
A counterexample to Gale's conjecture in $\mathbb{R}^3$
An Exact 93-Move Solution to a Nonlocal Crystal-Exchange Puzzle
Approximating Independent Sets Using Additive Combinatorics
Temporal Exploration and Rendezvous via Weisfeiler-Leman Colorings
Get the few papers worth your time in Artificial Intelligence every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.