Article · Wikipedia archive · Last revised Jul 14, 2026

Williamson conjecture

In combinatorial mathematics, specifically in combinatorial design theory and combinatorial matrix theory, the Williamson conjecture is that Williamson matrices of order exist for all positive integers . Four symmetric and circulant matrices , , , are called Williamson matrices if their entries are and they satisfy the relationship

Last revised
Jul 14, 2026
Read time
≈ 2 min
Length
455 w
Citations
5
Source

In combinatorial mathematics, specifically in combinatorial design theory and combinatorial matrix theory, the Williamson conjecture is that Williamson matrices of order n {\displaystyle n} exist for all positive integers n {\displaystyle n} . Four symmetric and circulant matrices A {\displaystyle A} , B {\displaystyle B} , C {\displaystyle C} , D {\displaystyle D} are called Williamson matrices if their entries are ± 1 {\displaystyle \pm 1} and they satisfy the relationship

A 2 + B 2 + C 2 + D 2 = 4 n I {\displaystyle A^{2}+B^{2}+C^{2}+D^{2}=4n\,I}

where I {\displaystyle I} is the identity matrix of order n {\displaystyle n} . John Williamson showed that if A {\displaystyle A} , B {\displaystyle B} , C {\displaystyle C} , D {\displaystyle D} are Williamson matrices then

[ A B C D B A D C C D A B D C B A ] {\displaystyle {\begin{bmatrix}A&B&C&D\\-B&A&-D&C\\-C&D&A&-B\\-D&-C&B&A\end{bmatrix}}}

is an Hadamard matrix of order 4 n {\displaystyle 4n} .1 It was once considered likely that Williamson matrices exist for all orders n {\displaystyle n} and that the structure of Williamson matrices could provide a route to proving the Hadamard conjecture that Hadamard matrices exist for all orders 4 n {\displaystyle 4n} .2 However, in 1993 the Williamson conjecture was shown to be false by Dragomir Ž. Ðoković through an exhaustive computer search, which demonstrated that Williamson matrices do not exist of order n = 35 {\displaystyle n=35} .3 In 2008, the counterexamples 47, 53, and 59 were additionally discovered.4

Following the negative result of Ðoković, which ruled out the existence of Williamson matrices of order n = 35 {\displaystyle n=35} , it was shown in 2019 that relaxing the symmetry and circulant requirements nevertheless permits a Hadamard matrix of this block form to exist for that order.5 One such instance is given by the sequences

a = --+--+--+++-+----+-+++--+--+-------
b = +---+---+-++-+--+-++-+---+---++++++
c = -++---+-+--+--++--+++++-+-+++++-+--
d = +----+++-+-+--++--+-+-+++----++---+

with the associated matrices defined by

A = circulant(a)
B = circulant(b)
C = fliplr(circulant(c))
D = circulant(d)


References

References

  1. Williamson, John (1944). "Hadamard's determinant theorem and the sum of four squares". Duke Mathematical Journal. 11 (1): 65–81. doi:10.1215/S0012-7094-44-01108-7. MR 0009590.
  2. Golomb, Solomon W.; Baumert, Leonard D. (1963). "The Search for Hadamard Matrices". American Mathematical Monthly. 70 (1): 12–17. doi:10.2307/2312777. JSTOR 2312777. MR 0146195.
  3. Ðoković, Dragomir Ž. (1993). "Williamson matrices of order 4 n {\displaystyle 4n} for n = 33 , 35 , 39 {\displaystyle n=33,35,39} ". Discrete Mathematics. 115 (1): 267–271. doi:10.1016/0012-365X(93)90495-F. MR 1217635.
  4. Holzmann, W. H.; Kharaghani, H.; Tayfeh-Rezaie, B. (2008). "Williamson matrices up to order 59". Designs, Codes and Cryptography. 46 (3): 343–352. doi:10.1007/s10623-007-9163-5. MR 2372843.
  5. Kline, Jeffery (26 July 2019). "Geometric search for Hadamard matrices". Theoretical Computer Science. 778: 33–46. doi:10.1016/j.tcs.2019.01.025.