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. A circulant Hadamard matrix of order n {\displaystyle n} is an n × n {\displaystyle n\times n} circulant matrix H {\displaystyle H} with entries in { − 1 , 1 } {\displaystyle \{-1,1\}} such that
H H T = n I n . {\displaystyle HH^{\mathsf {T}}=nI_{n}.}
The order-1 and order-4 examples are the only known real circulant Hadamard matrices. Elementary considerations show that any further example would have order 4 u 2 {\displaystyle 4u^{2}} . Richard Turyn proved that u > 1 {\displaystyle u>1} would have to be odd and could not be a prime power. Equivalently, the conjecture asserts that no nontrivial cyclic Menon–Hadamard difference set exists. The problem has equivalent formulations in terms of periodic autocorrelation, discrete Fourier transforms, Littlewood polynomials, perfect binary sequences, and cyclic Menon–Hadamard difference sets. It is also closely connected with the open problem of whether a Barker sequence can have length greater than 13.
Definition and the order-4 example Let a = ( a 0 , a 1 , … , a n − 1 ) {\displaystyle a=(a_{0},a_{1},\ldots ,a_{n-1})} , where each a j ∈ { − 1 , 1 } {\displaystyle a_{j}\in \{-1,1\}} . The circulant matrix generated by a {\displaystyle a} is
H = circ ( a 0 , a 1 , … , a n − 1 ) , H r , s = a s − r mod n . {\displaystyle H=\operatorname {circ} (a_{0},a_{1},\ldots ,a_{n-1}),\qquad H_{r,s}=a_{s-r{\bmod {n}}}.}
It is Hadamard exactly when distinct cyclic shifts of a {\displaystyle a} are orthogonal. In the terminology of weighing matrices, it is a circulant weighing matrix of weight n {\displaystyle n} . For n = 4 {\displaystyle n=4} , one example is
( 1 1 1 − 1 − 1 1 1 1 1 − 1 1 1 1 1 − 1 1 ) . {\displaystyle {\begin{pmatrix}1&1&1&-1\\-1&1&1&1\\1&-1&1&1\\1&1&-1&1\end{pmatrix}}.}
The four cyclic shifts of the generating row and their negatives give the eight order-4 circulant Hadamard matrices.
Necessary form of the order The all-ones vector is an eigenvector of a circulant matrix, with eigenvalue P ( 1 ) = ∑ j a j {\displaystyle P(1)=\sum _{j}a_{j}} . If H {\displaystyle H} is Hadamard, then
P ( 1 ) 2 = n , {\displaystyle P(1)^{2}=n,}
so n {\displaystyle n} is a square. Every real Hadamard matrix of order greater than 2 has order divisible by 4. It follows that every nontrivial circulant Hadamard matrix has order
n = 4 u 2 . {\displaystyle n=4u^{2}.}
There is no order-2 circulant Hadamard matrix, since its row sum would have to be the non-integer ± 2 {\displaystyle \pm {\sqrt {2}}} . Turyn proved the substantially stronger restrictions that u {\displaystyle u} must be odd and cannot be a prime power. He also developed the self-conjugacy test, a character-sum divisibility criterion. One useful consequence is that, if p a {\displaystyle p^{a}} is the exact power of an odd prime p {\displaystyle p} dividing u {\displaystyle u} , then
p 3 a ≤ 2 u 2 . {\displaystyle p^{3a}\leq 2u^{2}.}
Thus no single prime-power divisor of u {\displaystyle u} can be too large compared with the remaining factors.
Equivalent formulations
Periodic autocorrelation The periodic autocorrelation of a {\displaystyle a} at shift t {\displaystyle t} is
C a ( t ) = ∑ j = 0 n − 1 a j a j + t mod n . {\displaystyle C_{a}(t)=\sum _{j=0}^{n-1}a_{j}a_{j+t{\bmod {n}}}.}
The rows of H {\displaystyle H} are the cyclic shifts of a {\displaystyle a} , so
H H T = n I n ⟺ C a ( 0 ) = n and C a ( t ) = 0 ( 1 ≤ t < n ) . {\displaystyle HH^{\mathsf {T}}=nI_{n}\quad \Longleftrightarrow \quad C_{a}(0)=n\ {\text{ and }}\ C_{a}(t)=0\quad (1\leq t<n).}
Thus a circulant Hadamard matrix is equivalent to a binary sequence with zero nontrivial periodic autocorrelations, often called a perfect binary sequence.
Fourier and polynomial formulation Let
P ( z ) = ∑ j = 0 n − 1 a j z j {\displaystyle P(z)=\sum _{j=0}^{n-1}a_{j}z^{j}}
be the associated Littlewood polynomial, and let ω = e 2 π i / n {\displaystyle \omega =e^{2\pi i/n}} . Circulant matrices are diagonalized by the discrete Fourier matrix, and the eigenvalues of H {\displaystyle H} are P ( ω k ) {\displaystyle P(\omega ^{k})} , for 0 ≤ k < n {\displaystyle 0\leq k<n} . Consequently,
H is Hadamard ⟺ | P ( ω k ) | = n ( 0 ≤ k < n ) . {\displaystyle H{\text{ is Hadamard}}\quad \Longleftrightarrow \quad |P(\omega ^{k})|={\sqrt {n}}\quad (0\leq k<n).}
In this language, the conjecture says that a polynomial with coefficients ± 1 {\displaystyle \pm 1} cannot be exactly flat on all n {\displaystyle n} th roots of unity when n > 4 {\displaystyle n>4} .
Cyclic Menon–Hadamard difference sets Suppose n = 4 u 2 {\displaystyle n=4u^{2}} and, after negating the sequence if necessary, assume that ∑ j a j = 2 u {\displaystyle \sum _{j}a_{j}=2u} . Let
D = { j ∈ Z n : a j = − 1 } . {\displaystyle D=\{j\in \mathbb {Z} _{n}:a_{j}=-1\}.}
Then | D | = 2 u 2 − u {\displaystyle |D|=2u^{2}-u} . The equations C a ( t ) = 0 {\displaystyle C_{a}(t)=0} for nonzero t {\displaystyle t} are equivalent to requiring every nonzero element of Z 4 u 2 {\displaystyle \mathbb {Z} _{4u^{2}}} to occur exactly u 2 − u {\displaystyle u^{2}-u} times among the ordered differences d 1 − d 2 {\displaystyle d_{1}-d_{2}} with d 1 , d 2 ∈ D {\displaystyle d_{1},d_{2}\in D} . Hence a circulant Hadamard matrix of order 4 u 2 {\displaystyle 4u^{2}} is equivalent, up to complementing D {\displaystyle D} , to a cyclic difference set with parameters
( v , k , λ ) = ( 4 u 2 , 2 u 2 − u , u 2 − u ) . {\displaystyle (v,k,\lambda )=\left(4u^{2},\;2u^{2}-u,\;u^{2}-u\right).}
Difference sets with these parameters, and their complements, are called Menon difference sets, Menon–Hadamard difference sets, or Hadamard difference sets. They are named after P. Kesava Menon, who in 1962 studied difference sets satisfying v = 4 ( k − λ ) {\displaystyle v=4(k-\lambda )} . Their translates form the blocks of a symmetric 2 - ( 4 u 2 , 2 u 2 − u , u 2 − u ) {\displaystyle 2{\text{-}}(4u^{2},2u^{2}-u,u^{2}-u)} Menon design, and their sign functions give regular group-developed Hadamard matrices. Thus Ryser's conjecture is equivalently the assertion that no cyclic Menon–Hadamard difference set exists for u > 1 {\displaystyle u>1} . Many Menon–Hadamard difference sets are known in noncyclic groups. Broad constructions exist, for example, in groups formed from a group of order 4 and elementary abelian groups of odd-prime-power order. The exceptional requirement in the circulant Hadamard problem is therefore that the developing group be cyclic.
Difference-set context
Broader Ryser and Lander conjectures
For a ( v , k , λ ) {\displaystyle (v,k,\lambda )} difference set, the integer N = k − λ {\displaystyle N=k-\lambda } is called the order of the difference set. A broader conjecture, also attributed to Ryser, states that a difference set in a cyclic group must satisfy
gcd ( v , N ) = 1. {\displaystyle \gcd(v,N)=1.}
For a Menon–Hadamard difference set, v = 4 u 2 {\displaystyle v=4u^{2}} and N = u 2 {\displaystyle N=u^{2}} , so the circulant Hadamard conjecture is a special case. A stronger conjecture, proposed in 1983 by E. S. Lander, states that, if an abelian group of order v {\displaystyle v} contains a difference set of order N {\displaystyle N} and a prime p {\displaystyle p} divides both v {\displaystyle v} and N {\displaystyle N} , then the Sylow p {\displaystyle p} -subgroup cannot be cyclic. Lander's conjecture implies the broader cyclic difference-set conjecture and hence the circulant Hadamard conjecture. It has been proved when N {\displaystyle N} is a power of a prime greater than 3; for powers of 2 or 3, strong restrictions are known on any possible cyclic Sylow subgroup.
Bent functions and noncyclic analogues The Fourier-flat formulation also places the problem in the theory of generalized bent functions. A map f : Z n → Z 2 {\displaystyle f:\mathbb {Z} _{n}\to \mathbb {Z} _{2}} is generalized bent when, for every k {\displaystyle k} ,
| ∑ j = 0 n − 1 ( − 1 ) f ( j ) e − 2 π i k j / n | = n . {\displaystyle \left|\sum _{j=0}^{n-1}(-1)^{f(j)}e^{-2\pi ikj/n}\right|={\sqrt {n}}.}
Thus a circulant Hadamard matrix is equivalent to a binary generalized bent function on the cyclic group Z n {\displaystyle \mathbb {Z} _{n}} . More generally, generalized bent functions are linked by standard equivalences to group-invariant Butson-type Hadamard matrixs, perfect arrays, and, under suitable hypotheses, splitting relative difference sets. Classical Boolean bent functions have domain V = F 2 2 m {\displaystyle V=\mathbb {F} _{2}^{\,2m}} . If f : V → F 2 {\displaystyle f:V\to \mathbb {F} _{2}} is bent, then
H f = ( ( − 1 ) f ( x + y ) ) x , y ∈ V {\displaystyle H_{f}=\left((-1)^{f(x+y)}\right)_{x,y\in V}}
is a group-developed Hadamard matrix, and the support of f {\displaystyle f} , or its complement, is a Menon–Hadamard difference set in V {\displaystyle V} , with u = 2 m − 1 {\displaystyle u=2^{m-1}} . The group V {\displaystyle V} is noncyclic. For m > 1 {\displaystyle m>1} , these therefore give higher-order noncyclic analogues rather than counterexamples to Ryser's conjecture. Replacing the binary alphabet by complex roots of unity similarly leads to perfect polyphase sequences and circulant Butson-type Hadamard matrices.
Number-theoretic methods For a cyclic Menon–Hadamard difference set D ⊆ Z 4 u 2 {\displaystyle D\subseteq \mathbb {Z} _{4u^{2}}} and every nonprincipal character χ {\displaystyle \chi } , the difference-set equations imply
χ ( D ) χ ( D ) ¯ = u 2 . {\displaystyle \chi (D){\overline {\chi (D)}}=u^{2}.}
Thus χ ( D ) {\displaystyle \chi (D)} is a cyclotomic integer of prescribed absolute value. Number-theoretic approaches study the prime-ideal factorization, Galois symmetries, and possible fields of definition of these character sums. The classical background includes Gauss sums and Stickelberger's theorem, which gives explicit prime-ideal factorizations for powers of Gauss sums in cyclotomic fields.
Character sums, multipliers and self-conjugacy Turyn's method combines character sums with multiplier theory, self-conjugacy, and magnitude bounds. A numerical multiplier is an automorphism of the cyclic group that sends a difference set to one of its translates. When a rational prime is self-conjugate, or semiprimitive, modulo the relevant conductor, complex conjugation fixes the prime ideals above it. Divisibility of χ ( D ) χ ( D ) ¯ {\displaystyle \chi (D){\overline {\chi (D)}}} then forces divisibility of χ ( D ) {\displaystyle \chi (D)} itself. Bounds on the coefficients of the character sum can contradict this forced divisibility.
Field descent Schmidt's field descent method studies cyclotomic integers X ∈ Z [ ζ m ] {\displaystyle X\in \mathbb {Z} [\zeta _{m}]} satisfying X X ¯ = N {\displaystyle X{\overline {X}}=N} . Under explicit arithmetic conditions, multiplication by a root of unity moves X {\displaystyle X} into a much smaller cyclotomic subfield. Combining this descent with coefficient bounds gives restrictions on the exponent of groups containing difference sets and, in the cyclic case, rules out possible orders of circulant Hadamard matrices. Leung and Schmidt refined the method by decomposing group-ring elements into a part supported on the descended subfield and a part lying in the kernel of the relevant homomorphism. In 2012, they combined field descent with Turyn's self-conjugacy test, a sub-difference-set projection theorem of R. L. McFarland, and a prime-conductor bound based on work of Chan, obtaining further exclusions of possible circulant Hadamard orders.
Anti-field descent The anti-field-descent method, introduced by Leung and Schmidt in 2016, uses a complementary idea. A hypothetical circulant Hadamard matrix produces certain "twisted cyclotomic integers" that have small absolute value but cannot lie in a sufficiently small subfield. Lower bounds forced by this non-descent, including estimates for Cassels's M {\displaystyle M} -function, contradict the small modulus in many cases.
Computational results Computational searches apply arithmetic restrictions to possible values of u {\displaystyle u} , rather than enumerating the 2 4 u 2 {\displaystyle 2^{4u^{2}}} possible generating rows. An important ingredient is the search for Wieferich prime pairs: ordered pairs of primes ( q , p ) {\displaystyle (q,p)} satisfying
q p − 1 ≡ 1 ( mod p 2 ) . {\displaystyle q^{p-1}\equiv 1{\pmod {p^{2}}}.}
Such congruences arise in the field-descent restrictions and strongly constrain the possible prime divisors of u {\displaystyle u} . Passing the known arithmetic tests does not establish that a matrix exists. In 2014, Borwein and Mossinghoff reported 1,371 values of u ≤ 10 13 {\displaystyle u\leq 10^{13}} —equivalently, orders 4 < n ≤ 4 × 10 26 {\displaystyle 4<n\leq 4\times 10^{26}} —that were not eliminated by the tests they implemented. The five smallest were
11715 , 82005 , 550605 , 3854235 , 3877665. {\displaystyle 11715,\quad 82005,\quad 550605,\quad 3854235,\quad 3877665.}
Leung and Schmidt's anti-field-descent test subsequently eliminated 423 of those 1,371 cases. In that computation, the smallest value not ruled out remained
u = 11715 = 3 ⋅ 5 ⋅ 11 ⋅ 71 , {\displaystyle u=11715=3\cdot 5\cdot 11\cdot 71,}
corresponding to order 4 u 2 = 548,964,900 {\displaystyle 4u^{2}=548{,}964{,}900} . Separately, in 2017, Brooke Logan and Mossinghoff extended the search to u ≤ 10 15 {\displaystyle u\leq 10^{15}} . Their calculation left 4,489 orders n = 4 u 2 {\displaystyle n=4u^{2}} with 4 < n ≤ 4 × 10 30 {\displaystyle 4<n\leq 4\times 10^{30}} not excluded by the tests used in the search. Its principal improvement was a separate search for double Wieferich pairs { p , q } {\displaystyle \{p,q\}} , satisfying both
p q − 1 ≡ 1 ( mod q 2 ) and q p − 1 ≡ 1 ( mod p 2 ) . {\displaystyle p^{q-1}\equiv 1{\pmod {q^{2}}}\quad {\text{and}}\quad q^{p-1}\equiv 1{\pmod {p^{2}}}.}
The conjecture continued to be stated as an open problem in work published in 2024.
Relation to Barker sequences A Barker sequence of length ℓ {\displaystyle \ell } is a sequence b 1 , … , b ℓ ∈ { − 1 , 1 } {\displaystyle b_{1},\ldots ,b_{\ell }\in \{-1,1\}} whose nontrivial aperiodic autocorrelations satisfy
| ∑ j = 1 ℓ − t b j b j + t | ≤ 1 ( 1 ≤ t < ℓ ) . {\displaystyle \left|\sum _{j=1}^{\ell -t}b_{j}b_{j+t}\right|\leq 1\qquad (1\leq t<\ell ).}
Turyn and Storer proved that no Barker sequence of odd length greater than 13 exists. For ℓ > 13 {\displaystyle \ell >13} , the existence of a Barker sequence implies the existence of a circulant Hadamard matrix of the same order. Therefore Ryser's conjecture would imply that no Barker sequence has length greater than 13. The arithmetic restrictions for Barker sequences are stronger than those for arbitrary circulant Hadamard matrices. In particular, if a Barker sequence of length ℓ = 4 u 2 > 13 {\displaystyle \ell =4u^{2}>13} exists, then every prime divisor p {\displaystyle p} of u {\displaystyle u} satisfies p ≡ 1 ( mod 4 ) {\displaystyle p\equiv 1{\pmod {4}}} . Borwein and Mossinghoff's 2014 search produced 237,807 candidate lengths below 10 100 {\displaystyle 10^{100}} that survived the tests used in that search. In 2016, Leung and Schmidt ruled out 229,682 of those candidates and proved that no Barker sequence has length
13 < ℓ ≤ 4 × 10 33 . {\displaystyle 13<\ell \leq 4\times 10^{33}.}
These Barker-sequence candidate counts should not be confused with the separate list of candidate orders for general circulant Hadamard matrices.
Quantitative Ryser conjecture In 2024, Stefan Steinerberger proposed the quantitative Ryser conjecture, a strengthened form of the circulant Hadamard conjecture. It asserts that there is an absolute constant ε 0 > 0 {\displaystyle \varepsilon _{0}>0} such that, for every n > 4 {\displaystyle n>4} and every Littlewood polynomial
P ( z ) = ∑ k = 0 n − 1 a k z k , a k ∈ { − 1 , 1 } , {\displaystyle P(z)=\sum _{k=0}^{n-1}a_{k}z^{k},\qquad a_{k}\in \{-1,1\},}
one has
max 0 ≤ j < n | | P ( e 2 π i j / n ) | − n | ≥ ε 0 n 1 / 4 . {\displaystyle \max _{0\leq j<n}\left|\left|P\!\left(e^{2\pi ij/n}\right)\right|-{\sqrt {n}}\right|\geq \varepsilon _{0}n^{1/4}.}
Steinerberger called this formulation ultra-flat at roots of unity. If A = circ ( a 0 , … , a n − 1 ) {\displaystyle A=\operatorname {circ} (a_{0},\ldots ,a_{n-1})} , its singular values are the numbers | P ( e 2 π i j / n ) | {\displaystyle |P(e^{2\pi ij/n})|} . Thus the conjecture is equivalently the spectral-gap assertion
max 1 ≤ j ≤ n | σ j ( A ) − n | ≥ ε 0 n 1 / 4 , {\displaystyle \max _{1\leq j\leq n}\left|\sigma _{j}(A)-{\sqrt {n}}\right|\geq \varepsilon _{0}n^{1/4},}
where σ 1 ( A ) , … , σ n ( A ) {\displaystyle \sigma _{1}(A),\ldots ,\sigma _{n}(A)} are the singular values of A {\displaystyle A} . The ordinary Ryser conjecture says only that the left-hand side is nonzero; the quantitative version predicts a universal gap of order n 1 / 4 {\displaystyle n^{1/4}} . The exponent 1 / 4 {\displaystyle 1/4} would be optimal up to logarithmic factors. When n {\displaystyle n} is prime, probabilistic modifications of the Legendre symbol give circulant sign matrices satisfying
max 0 ≤ j < n | | P ( e 2 π i j / n ) | − n | = O ( n 1 / 4 log n ) . {\displaystyle \max _{0\leq j<n}\left|\left|P\!\left(e^{2\pi ij/n}\right)\right|-{\sqrt {n}}\right|=O\!\left(n^{1/4}{\sqrt {\log n}}\right).}
Consequently, the power of n {\displaystyle n} in the conjectured lower bound cannot in general be increased beyond