← All problems

Ryser's conjecture on circulant Hadamard matrices

63 years old · traced to

Let nn be a positive integer and let a=(a0,a1,…,an−1)a=(a_{0},a_{1},\dots ,a_{n-1}) with aj∈{−1,1}a_{j}\in\{-1,1\} for every jj. Let H=circ⁡(a0,a1,…,an−1)H=\operatorname{circ}(a_{0},a_{1},\dots ,a_{n-1}) be the n×nn\times n circulant matrix generated by aa, that is, the matrix with entries

Hr,s=as−r mod n,0≤r,s≤n−1.H_{r,s}=a_{s-r\bmod n},\qquad 0\le r,s\le n-1 .

Call HH a circulant Hadamard matrix of order nn if

HHT=nIn,HH^{\mathsf T}=nI_{n},

where InI_{n} is the n×nn\times n identity matrix. Equivalently, writing

Ca(t)=∑j=0n−1ajaj+t mod nC_{a}(t)=\sum_{j=0}^{n-1}a_{j}a_{j+t\bmod n}

for the periodic autocorrelation of aa, the matrix HH is a circulant Hadamard matrix precisely when Ca(t)=0C_{a}(t)=0 for all tt with 1≤t≤n−11\le t\le n-1; and, writing P(z)=∑j=0n−1ajzjP(z)=\sum_{j=0}^{n-1}a_{j}z^{j} and ω=e2πi/n\omega=e^{2\pi i/n}, precisely when ∣P(ωk)∣=n|P(\omega^{k})|=\sqrt{n} for all 0≤k≤n−10\le k\le n-1.

Then: for every nn and every such aa, if H=circ⁡(a0,…,an−1)H=\operatorname{circ}(a_{0},\dots ,a_{n-1}) satisfies HHT=nInHH^{\mathsf T}=nI_{n}, then n≤4n\le 4.

Equivalently, for every integer u≥2u\ge 2 there is no subset D⊆Z4u2D\subseteq \mathbb{Z}_{4u^{2}} with ∣D∣=2u2−u|D|=2u^{2}-u such that every nonzero element of Z4u2\mathbb{Z}_{4u^{2}} occurs exactly u2−uu^{2}-u times among the ordered differences d1−d2d_{1}-d_{2} with d1,d2∈Dd_{1},d_{2}\in D, i.e. no cyclic difference set with parameters (v,k,λ)=(4u2, 2u2−u, u2−u)(v,k,\lambda)=(4u^{2},\,2u^{2}-u,\,u^{2}-u) exists.

Equivalent formulations
  1. In matrix theory and combinatorics, Ryser's conjecture on circulant Hadamard matrices, also called the circulant Hadamard matrix conjecture, states that no real circulant Hadamard matrix has order greater than 4. The conjecture is attributed to Herbert John Ryser, who recorded the problem in 1963.

    source: Wikipedia

  2. Let γ∈(±1)N\gamma\in(\pm1)^N be a binary vector, and define the circulant matrix H∈MN(±1)H\in M_N(\pm1) by

    Hij=γj−i,H_{ij}=\gamma_{j-i},

    with indices interpreted modulo NN. A circulant Hadamard matrix has pairwise orthogonal rows. The matrix

    K4=(−11111−11111−11111−1)K_4=\begin{pmatrix}-1&1&1&1\\ 1&-1&1&1\\ 1&1&-1&1\\ 1&1&1&-1\end{pmatrix}

    is an example, and its conjugates are also solutions. Circulant Hadamard conjecture. The only Hadamard matrices which are circulant are K4K_4 and its conjugates, regardless of the value of N∈NN\in\mathbb N. Equivalently, if S⊂{1,…,N}S\subset\{1,\ldots,N\} is the set of positions of the −1-1 entries of γ\gamma, then for N≠4N\ne4 no such set SS can satisfy

    ∣S∩(S+k)∣=∣S∣−N/4|S\cap(S+k)|=|S|-N/4

    for every nonzero kk modulo NN. This simple-looking problem remains open; the source notes that the only known solutions arise at order four.

    source: Teo Banica, “Advanced linear algebra”, arXiv:2506.18666 (2026).

References
  1. Wikipedia, Ryser's conjecture on circulant Hadamard matrices, the article this problem comes from.

Source: Wikipedia

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 1

Claimed by OpenAI.See full solutionHide full solution

Claims that a real circulant Hadamard matrix exists if and only if its order is 1 or 4, with the stated Barker-sequence consequence.

Repository: https://github.com/openai/math

Manuscript: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-circulant-Hadamard-conjecture-September-23-2026/paper.pdf

  • OpenAI-179-01-The-circulant-Hadamard-conjecture.pdf371,693 bytesOpen