Combinatorics Designs and configurations Conjecture
Hadamard conjecture
Builds on Hadamard matrix
Statement
For each positive integer , there is a Hadamard matrix of order .
Remarks
A Hadamard matrix of order can exist only when is a multiple of , so the conjecture says that this necessary condition is also sufficient. The conjecture is open. Sylvester's construction by Kronecker products gives all orders . Paley's construction uses quadratic residues in a finite field and gives order when is a prime power. Combining such constructions covers many multiples of ; the smallest multiple of for which no Hadamard matrix is known is .
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Identity matrix object
- Matrix definition
- Transpose definition
- Hadamard matrix definition
- Hadamard conjecture conjecture
Further reading
About this page
| Tag | 6X9S10E3M2 |
|---|---|
| URI | m2://6X9S10E3M2 |
| Kind | conjecture |
| Writing | W0 stub |
| MSC | 05B20 |
| Status | This copy of the site has no build data. Run m2 status 6X9S10E3M2. |
| About | Hadamard matrix |
| Uses | Hadamard matrix |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.