WorksMathematics
Recent progress in the construction of Hadamard matrices
Abstract
A Hadamard matrix is a square matrix with entries whose rows are mutually orthogonal. Hadamard matrices are conjectured to exist at every order divisible by ; 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 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 orders up to 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.
To Jennifer R. Seberry and Dragomir Ž. Ðoković, pioneers in the existence of Hadamard matrices.
Introduction
Let be an complex matrix with entries of modulus at most . Hadamard proved that , with equality if and only if every entry has modulus and [52]. Over the bound is attained at every order by the character table of . Over the extremal matrices are Hadamard matrices, which exist only at orders , and . The first infinite family is due to Sylvester [96]. Paley described further infinite families and conjectured that a Hadamard matrix exists at every order [81].
The conjecture is settled at orders below by the constructions of Sylvester and Paley together with Kronecker products. Order was resolved computationally by Baumert, Golomb and Hall [5], and order by Baumert in 1966 [6]. By 1977 the smallest open order was [54, 89]; it was settled by Sawade in 1985 [83], leaving as the smallest unsettled order. From the construction of order by Kharaghani and Tayfeh-Rezaie [59], the smallest open order was . On 12 August 2026 Alpöge, Voinov and Reynolds-Haertle announced Hadamard matrices at the twelve orders
, , , , , , , , , , , ,
which were the only open orders below 2000 [3]. The announcement gives the matrices but not the method of construction.
Verifying the twelve matrices is a matrix multiplication; their structure is less apparent, and we describe it in detail. Each is a Goethals–Seidel array over an abelian group. Nine are over cyclic groups, four of them with a border of width , and three are over non-cyclic groups, with a wider border that is constant on the cosets of a subgroup.
A Hadamard matrix is therefore known at every order below 2000 divisible by 4. We construct Hadamard matrices at sixteen further orders below 10 000, record the orders settled by others while this paper was in preparation, and list the 95 orders at which no Hadamard matrix is currently known; the smallest is . As a survey of constructions, the paper is written for readers new to the subject; for a broader introduction we refer to the monographs [56, 27, 92, 93].
Section 2 gives definitions and classical constructions of Hadamard matrices. Section 3 describes the matrices at the twelve orders listed above. Section 4 surveys the known constructions, describes the new matrices, ours and those of others, and tabulates the open orders up to 10 000. Section 5 lists open problems. Every Hadamard matrix constructed in this paper is publicly available at https://www.math74.com/Hadamard/ and was verified by an exact computation of .
Hadamard matrices: a rapid overview
The identity and all-ones matrices of order are and ; the all-ones row vector is and is the matrix with ones on the back-diagonal, with sizes clear from context; in displayed arrays, and stand for 1 and .
Theorem 1 (Hadamard [52]). Let be an real matrix with . Then , with equality if and only if for all and .
The bound follows directly from the inequality , where are the rows of , together with . The inequality was conjectured by Kelvin and proved by Hadamard; see [14] for its history. Hadamard drew attention to real matrices meeting the bound, and constructed examples at orders 12 and 20.
Definition 1. A Hadamard matrix of order is an matrix with entries in satisfying . We write for a Hadamard matrix of order . More generally, a Butson Hadamard matrix is an matrix with entries in the th roots of unity and [16], so that a is a Hadamard matrix.
Permuting and negating rows or columns preserves the defining equation. Two Hadamard matrices related by such operations are equivalent, and every Hadamard matrix is equivalent to one whose first row and column consist of 1s. Comparing the first three rows of such a normalised matrix shows that or .
Sylvester observed that is a Hadamard matrix of order , so that
is an [96].
The next substantial contribution to the existence of Hadamard matrices after Hadamard is due to Paley [81]. For an odd prime power , let be the quadratic character of with the convention that , and the Jacobsthal matrix. The character sum for gives and , and . A Hadamard matrix is skew if , and a conference matrix of order is a matrix with zero diagonal, entries off the diagonal, and .
Theorem 2 (Paley [81]). Let
If , then is skew-symmetric and is a skew Hadamard matrix of order . If , then is a symmetric conference matrix and
is a Hadamard matrix of order .
The eigenvalues of are given by Gauss sums, and the consideration of Gauss and Jacobi sums gives rise to a large number of cyclotomic constructions of Hadamard matrices. For the theory of cyclotomic numbers on which these depend see Storer or Hall [95, 53]; for constructions from cyclotomy and character sums see Whiteman [109], Spence [94] and Yamada [116]; and for the related supplementary difference sets the surveys of Seberry and Yamada [92] and of Wallis, Street and Wallis [107]. Cocyclic and group-developed constructions are treated in [27, 56].
Plug-in constructions
Another approach builds from four blocks placed in a fixed array. Williamson [112] took to be symmetric circulant -matrices of order with . Since circulant matrices commute, the array
is then a Hadamard matrix of order . The Hadamard matrix of order 92 was obtained in this way, with [5]. Turyn’s family supplies Williamson matrices of order for every prime power [103]. Williamson matrices do not exist at every odd order, however. Đoković showed that there are none of order 35 [32], and Holzmann, Kharaghani and Tayfeh-Rezaie found none of orders 47, 53 or 59 [55].
Goethals and Seidel [49] removed the symmetry requirement of the Williamson array by varying the array into which the circulant matrices are inserted.
Theorem 3 (Goethals–Seidel [49]). Let be circulant -matrices of order with . Then
is a Hadamard matrix of order .
In 2026, Williamson, Yacobi and Zinn-Justin generated Goethals–Seidel Hadamard matrices of orders up to 252 by local search, guided by a transformer trained on the output of that search [111].
An alternative approach is to allow a constant negative value off the diagonal in the sum of Gram matrices, which is then absorbed into a border of entries. The basic example uses two circulants.
Theorem 4 ([47]). Let and be circulant -matrices of order satisfying
normalised so that every row of and of sums to 1. Then
is a Hadamard matrix of order .
Condition (1) forces the row sums of and to be , and so is odd. For a -sequence , the periodic autocorrelation , with indices mod , is the inner product of rows and of the circulant with first row . The first rows of and form a Legendre pair: two -sequences whose periodic autocorrelations sum to at every non-zero shift. The name comes from the Legendre sequence of a prime , whose periodic autocorrelation is at every non-zero shift, so that two copies of it form a Legendre pair. Legendre pairs are known at infinitely many lengths and it is conjectured that one exists at every odd length [38], which would give a Hadamard matrix at every order .
We conclude this section with a construction combining the four circulants of Theorem 3 with the border and constant negative autocorrelation of Theorem 4.
Theorem 5. Let be circulant -matrices of even order with
normalised so that has row sum and , , have row sum . Then
is a Hadamard matrix of order .
Multiplying (2) by shows that the squares of the four row sums add to . For even the row sums are even, so one of them is and the others are . Negating or permuting preserves (2). By analogy with Legendre pairs, the term Legendre quadruples seems appropriate for four -sequences of the same length whose periodic autocorrelations sum to at every non-zero shift. The first rows of in Theorem 5 form a Legendre quadruple of even length .
The twelve orders settled in 2026
Each of the twelve orders is of the form with a prime, : the primes are 167, 179, 223, 283, 311, 347, 359, 419, 443, 479, 487, 491. The announcement encodes the twelve matrices as a single string of signs, together with a short sed program that assembles them, and does not describe how they were found [3]. Each assembled matrix is a Goethals–Seidel array of order in four generators over an abelian group of order , with a border of width , so that (Table 1).
| 892 | 0 | 223 | 0 | 3 | 75 | |
| 1132 | 0 | 283 | 0 | 3 | 95 | |
| 1244 | 0 | 311 | 0 | 5 | 63 | |
| 1948 | 0 | 487 | 0 | 9 | 55 | |
| 1964 | 0 | 491 | 0 | 7 | 71 | |
| 668 | 4 | 166 | 1 | 166 | ||
| 716 | 4 | 178 | 1 | 178 | ||
| 1676 | 4 | 418 | 15 | 42 | ||
| 1772 | 4 | 442 | 12 | 50 | ||
| 1916 | 12 | 476 | ||||
| 1388 | 20 | 342 | 6 | 70 | ||
| 1436 | 28 | 352 | 5 | 96 |
Table 1. The twelve matrices; is the matrix order, the border width, is a group of order , the column gives the values of (3) on and, when , off , is the multiplier group (Definition 2) and the number of its orbits on .
Over a non-cyclic group, circulants are replaced by group-developed matrices , for , and by the matrix of the map ; Theorems 3 and 5 then hold as stated. The periodic autocorrelation is the inner product of rows and of . In all twelve matrices
for a subgroup of , where the sum is over the generators of and . When , is cyclic, and (3) is the hypothesis of Theorem 3 or Theorem 5; when , is a proper subgroup of index . Summing (3) over gives for the row sums of the generators.
Definition 2. Let . A map is -invariant, and is a multiplier group for , if for all and , that is, if is constant on the -orbits of .
The five matrices with , at orders 892, 1132, 1244, 1948 and 1964, are given by Theorem 3 with circulants of prime order , and their generators share a multiplier group. In the theory of difference sets a multiplier of a set need only satisfy for some [8]; when such a has a -invariant translate, with the same periodic autocorrelation.
Lemma 6. If is -invariant, then for all and .
If the four generators are -invariant and has orbits on , each generator is determined by a choice of sign for each orbit. The multiplier group is a restriction chosen for the search. For prime, . At these five orders , and no generator is symmetric.
The four matrices with , at orders 668, 716, 1676 and 1772, are given by Theorem 5, up to the signs of the border, from Legendre quadruples of length . At orders 668 and 716 the generators have no multiplier, so all signs are free; Best, Ðoković, Kharaghani and Ramp observed that Turyn-type sequences and would give these two orders [7]. At orders 1676 and 1772, and , with multiplier groups of orders 15 and 12. For squarefree , is the sum of over the subsets , where is the image of in .
The three matrices with are over non-cyclic groups: at order 1916, and ; at order 1388, and ; at order 1436, and . Each is given by the following theorem, with , 6 and 8.
Theorem 7. Let be an abelian group of order , let be a proper subgroup of of index , and let . Let be the incidence matrix of elements and cosets of , and . Let be group-developed -matrices over with
and let be the array of Theorem 3 in . Let be a Hadamard matrix of order , and let and be -matrices of sizes and with
Then
is a Hadamard matrix of order .
Since is the -matrix of pairs lying in a common coset of , the condition on is (3). The theorem follows on computing blockwise, using and .
At order 1388 the four generators are fixed by a common group of order 6. At order 1436 they are fixed by multiplication by the quadratic residues modulo 11 on the factor . The sets of entries of the four generators have sizes . When they form supplementary difference sets -: every non-zero element of arises exactly times as a difference of two elements of one of the sets. When they form a divisible difference family relative to [77], in which each element of arises times and each element of arises times. In every case , with when .
For a character of write . By (3), for every character not trivial on , so a generator has a flat spectrum when at all such . We measure flatness by the mean of over these characters. At , Parseval’s identity gives , so is essentially the mean square of .
A random sequence has . To model a typical solution, we treat the values at characters in distinct orbits of as independent exponential variables, as they approximately are for random sequences, conditioned on the four generators summing to at each character. A typical solution then has , and a typical solution with at every such character has .
The generators of the matrices with are typical, with (Table 2). Those with are much flatter: at every non-trivial character, and , well below the value 0.3 that this cutoff alone gives. By a Chernoff bound under the model, at most (at 1948) to (at 1132) of the solutions with the same multiplier group are as flat. This suggests that the search at was restricted to sequences with nearly flat spectra. At 668 and 716, by contrast, the generators have no multiplier group and are not unusually flat, so there is no evidence that either restriction was used at these orders.
| - | |||
| 892 | |||
| 1132 | |||
| 1244 | |||
| 1948 | |||
| 1964 | |||
| 668 | |||
| 716 | |||
| 1676 | |||
| 1772 | |||
| 1916 | |||
| 1388 | |||
| 1436 |
Table 2. Row sums of the generators, parameters of their sets of entries , and the flatness of each generator.
Construction of Hadamard matrices of order
Theorems 3, 4 and 5 reduce the construction of a Hadamard matrix to the construction of a few circulant matrices. A circulant is determined by its first row, so the unknowns are sequences, and the hypotheses of the three theorems say that the periodic autocorrelations of the first rows sum to 0, and respectively at every shift . The non-periodic autocorrelation of is .
Sequences whose non-periodic autocorrelations cancel are more rigid, but they can be concatenated and interleaved to give longer sequences of the same kind, and most of the recursive constructions rest on them. The families in use are the following.
A Golay pair of length is a pair of -sequences with for all [50]. A complex Golay pair is defined in the same way, with entries in and .
Base sequences are four -sequences of lengths whose non-periodic autocorrelations sum to 0 at every .
Turyn-type sequences are four -sequences of lengths with at every . The concatenations and , together with and , form base sequences [104].
-sequences of length are four -sequences, exactly one of which is non-zero in each position, whose non-periodic autocorrelations sum to 0 at every . Base sequences give -sequences of length [20, 104].
-matrices of order are four circulant -matrices of order with disjoint supports and . The sums of the periodic autocorrelations of the rows generating the circulants are zero at every . -sequences generate -matrices but the generating rows of -matrices are not necessarily -sequences.
Williamson-type matrices are four -matrices of order with for all and . Plugged into the Williamson array they give an . The Williamson matrices of Section 2.1 are the circulant symmetric case.
A theorem of Cooper and Wallis combines -matrices of order and Williamson-type matrices of order into a Hadamard matrix of order [20]. Taking , -sequences of length give an , so base sequences give an , and give an . The Hadamard matrix of order was obtained in this way from a [59]. Golay pairs enter through Turyn’s and Yang’s composition theorems, which combine them with base sequences or -sequences to give -sequences of greater length [104, 118]. Craigen, Holzmann and Kharaghani showed that complex Golay pairs of lengths and give a Hadamard matrix of order [23]. These constructions can be described with orthogonal designs [48].
Not every known order comes from a family. Twenty-nine orders up to 10 000 are reached by none of the families in Table 4, only by matrices found by computer. Four of these were obtained by Đoković and coauthors from supplementary difference sets in the Goethals–Seidel array: 764 [34], 956 [33], and 1004 and 2524 [37]. Twelve are those of Section 3; five, 3732, 4492, 5020, 5788 and 5932, were found by the present authors; and eight, described below, were found by Schumer, Cooley and Kumar. Orders first settled by computer but now reached by a family are not counted as sporadic: Sawade’s order 268 [83], and Đoković’s order 652 [30] and our order 8476 , which the theorem of Cooper and Wallis now gives from -matrices of order 163. Cati and Pasechnik have implemented the known constructions up to 1208 in SageMath [17].
Table 4 lists the constructions used to cover orders up to 10 000, with the number of orders each reaches. Table 3 records where the ingredients of the recursive constructions are known to exist. The remaining recursive constructions take Hadamard matrices or Williamson-type matrices as input, and we refer to [92] for them.
Remark 8. Corollary 2 of [74], and Corollary 8.8(1) of [92], omit the hypothesis that the input be symmetric, which the construction listed in Table 4 as Miyamoto II requires. As a result, order 2076 is wrongly claimed in [74, 87], and order 6108 in [35 Proposition 3.3]. We construct a Hadamard matrix of order 2076 below, and Kumar has constructed one of order 6108 [62].
The known constructions described above give Hadamard matrices at all but 133 orders . By computer search we found Hadamard matrices at sixteen of these orders. To construct a matrix at order 2076, we found by computer a symmetric , built from a doubly bordered array and two matrices of order 42 with entries in , one circulant and one back-circulant. It gives Williamson-type matrices of order 173, and so the orders for odd , closing six orders otherwise open. The matrices at orders 3732, 4492, 5932 and 5020 are given by Theorem 3, with generators invariant under multiplier groups of orders 31, 33, 39 and 50. Those at orders 5788 and 8476 are given by Theorem 7, with , and . We also found -matrices of orders and 163, invariant under multiplication by the subgroup of order 5 (resp. 9) of . With Williamson matrices of orders 9, 11 and 13, the theorem of Cooper and Wallis gives the orders 5436, 6644 and 7852 from , and order 7172 from . These -matrices, and these four orders, had been posted earlier by others; we found ours independently. Schumer gave -matrices of order 151 and Hadamard matrices of orders 5436, 6644 and 7852 [88], and Jones gave -matrices of order 163 and Hadamard matrices of orders 7172 and 8476 [57].
Twenty-two further orders were settled by others while this paper was in preparation; we checked each of their matrices by computing exactly. Cooley found matrices of orders 2092, 2292 and 2588 by Theorem 5, from Legendre quadruples of lengths 522, 572 and 646, and of order 3676 by Theorem 3 over [19]; Schumer had earlier given a skew Hadamard matrix of order 3676 by the same theorem [88]. Kumar found a matrix of order 2284 by Theorem 3 over , and matrices of orders 2636 and 3964 by Theorem 7 with , over and [62]. Kharaghani, Mohammadian, Tayfeh-Rezaie and Zaitsev independently found a BH(1142, 4), which also gives order 2284 [119]. At order 2148 Kumar used a border of width 12 over , with of index 3, where the sum of the periodic autocorrelations is on and 0 off .
Kumar constructed thirteen further orders without search, from a product theorem of Seberry and Yamada [91 Theorem 4]: if a Hadamard matrix of order is a array of circulants , and are -matrices of order , then the matrices satisfy , and the Goethals–Seidel array over gives a Hadamard matrix of order . For a prime power , Paley’s matrix of order is equivalent to such an array with [117, 85]. With -matrices of order , 5 and 7 this gives the ten orders 3156, 5260, 5860, 6036, 6356, 6756, 7364, 7660, 8204 and 8620, each of the form with prime. Miyamoto’s matrices of order [74], built from near-Williamson matrices [58] or from a periodic Golay pair [39], can be arranged in the same way, and give the orders 6108, 7532 and 9708, with , 269 and 809. Finally, order follows from Cooley’s matrix of order 2292 by Miyamoto I. Table 5 lists the remaining 95 orders at which no Hadamard matrix is currently known. It was produced by applying the constructions of Table 4 to all orders currently known, including the twelve of § 3 and those described above. It updates [93 Table A.17], which gives, for each odd , the least for which a Hadamard matrix of order was known. The smallest open order is now . Every prime appearing in this table is congruent to 3 mod 4.
| Construction | Orders | Count |
| Direct constructions | ||
| Paley I [81] | , . | 625 |
| Paley II [81] | , . | 355 |
| Sylvester [96] | . | 12 |
| Spence [94] | , with prime or a prime power. | 12 |
| Mathon [73] | , , a prime power. | 3 |
| Seberry–Whiteman [90] | . | 2 |
| Recursive constructions | ||
| Cooper–Wallis [20] | , given -matrices of order and WT(). | 1950 |
| Paley and Miyamoto blocks [91, 62] | , given -matrices of order , with a prime power; also 6108, 7532, 9708. | 1662 |
| Williamson array [112] | , given WT(). | 1595 |
| Miyamoto II [74] | WT() for , given a symmetric BH(()/2, 4); reaches . | 1491 |
| Agaian [1] | , given , . | 1230 |
| Kronecker product | , given , . | 1227 |
| Craigen–Holzmann–Kharaghani [23] | , given complex Golay pairs of lengths and . | 1001 |
| Craigen–Seberry–Zhang [24] | , given , , , . | 624 |
| Miyamoto I [74] | , , given . | 200 |
| Seberry–Yamada [92] | , given WT(()/2). | 165 |
| Yamada [116] | , , given skew . | 78 |
| Miyamoto III [74 \text{Theorem 7}] | , , with and prime. | 46 |
| Yamada [116] | , , given a symmetric conference matrix of order . | 34 |
| Sporadic (computer search) | 764 [34], 956 [33], 1004 and 2524 [37]; 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, 1964 [3]; 3732, 4492, 5020, 5788, 5932 (this paper); 2092, 2292, 2588 [19]; 3676 [88, 19]; 2148, 2284, 2636, 3964 [62]. | 29 |
Table 4. Constructions of Hadamard matrices and the number of orders each reaches. An order reached by several constructions is counted under each. WT() denotes Williamson-type matrices of order .
| # | ||
| 69 | 599, 643, 719, 739, 751, 839, 859, 863, 907, 947, 971, 1019, 1031, 1039, 1051, 1087, 1103, 1187, 1223, 1259, 1283, 1291, 1319, 1327, 1367, 1423, 1427, 1439, 1451, 1471, 1487, 1499, 1543, 1559, 1567, 1571, 1579, 1583, 1619, 1663, 1667, 1699, 1747, 1783, 1787, 1831, 1847, 1871, 1879, 1907, 1979, 1987, 2027, 2039, 2063, 2083, 2087, 2099, 2203, 2207, 2251, 2287, 2339, 2347, 2371, 2383, 2399, 2423, 2459 | |
| 7 | 223, 419, 479, 491, 571, 631, 643 | |
| 6 | 191, 223, 359, 419, 443, 463 | |
| 3 | 167, 283, 347 | |
| 1 | 191 | |
| 1 | 179 | |
| 2 | 167, 179 | |
| 6 | 599, 719, 739, 839, 1031, 1087 | |
| 95 |
Table 5. Orders at which no Hadamard matrix is known, grouped by the form of . Each entry is the prime ; the second column gives the number of orders in each row.
Open problems
We collect open problems on Hadamard matrices and on five related topics, with recent references for each. The open cases in Table 3 form a further series of open problems.
| Ingredient | Used in | Known to exist | Smallest open |
| Golay pairs, length | -sequences | [50, 104]; no other [9, 45]. | 106 |
| Turyn-type sequences | -sequences | even [7, 69, 70]. | 48 |
| Base sequences | -sequences | [35, 108], and [35]. | 44 |
| -sequences, length | Cooper–Wallis | , and for Golay lengths ; from ; from ; Yang multiplication [118]. All except possibly [35]. | 97 |
| -matrices, order | Cooper–Wallis | as for -sequences; , 109, 197 [62]; 103 [87]; 151 [88]; 163 and 181 [57]; 151 and 163 also, independently, in this paper. | 127 |
| Williamson-type matrices | Williamson array, Cooper–Wallis, Seberry–Yamada | , [103]; from a symmetric , [74]; from , [92]; the orders below 2000 in [92 Table A.1] except 543 and those resting on its Corollary 8.8(1); every odd , and 73, 79, 91, 93, 95, 97, 103, 109, 127, 133, 181 [58]; 111 [62]; 127, from good matrices [31]. | 71 |
| Skew Hadamard matrices | Yamada | , [81]; doubling; Spence family [94]; for odd ; 276 and 292 [36] | 356 |
| Symmetric conference matrices | Yamada | , [81]; , and prime powers [73]; [90]; 66 [51]; 86 [105]. | |
| Complex Golay pairs | Craigen–Holzmann–Kharaghani | 1, 3, 5, 11, 13 and every even except 14 [11]; for complex Golay lengths [21]; further products [23]. | 29 |
Table 3. Ingredients of the recursive constructions of Hadamard matrices.
Hadamard matrices
Problem 1 (Legendre pairs). Does a Legendre pair exist at every odd length ?
Problem 2 (Kotsireas, 2019). Let and be odd primes, not necessarily distinct, and let be the Legendre symbol modulo . Do the sequences , of length always -uncompress to a Legendre pair of length , that is, are they the -compressions of some putative Legendre pair of length ? Here the -compression of is the sequence of length with th entry . See [60] for computational results.
Problem 3 (Turyn-type sequences). Does exist for every even ? Is there an infinite family of Turyn-type sequences?
Paley’s matrices of order with mod 4 are skew, and Seberry conjectured that skew Hadamard matrices exist at every order divisible by 4; see [61].
Problem 4 (Skew Hadamard matrices). Is there a skew Hadamard matrix at every order ?
The maximal determinant problem
When and there is no Hadamard matrix, and one asks for
For odd , Barba’s bound can be attained only if is a square [4]. For , the bound of Ehlich and Wojtas can be attained only if is a sum of two squares [40, 114]. For , Ehlich gave a sharper bound , which for can be attained only if [40]; Cohn showed that is an integer only when [18], and Tamura, using the Hasse–Minkowski theorem, that the smallest order at which could be attained is at least [100]. The survey [14] gives proofs and the state of the problem in 2021.
At , Momihara, Suda and Xiang [76], and Li, Momihara and Xiang [67], constructed infinite families of matrices with ; their orders form a set of density zero. Butbaia et al. found the largest known determinants at [15], and Nuñez Ponasso studied the problem over roots of unity [78]. At the best ratio known at a single order is , at [15], and the best known along an infinite family is [14].
Problem 5 (Barba bound). Is at every for which is a square? Brouwer [13] and Whiteman [110] showed that it is at for every odd prime power ; the smallest orders left undecided in [14] are and .
Problem 6 (Ehlich bound). Is for any with ?
Problem 7 (Near-optimal families). Is there an infinite set of orders along which ? Does as through all ? For the second, the best general bound is due to Brent, Osborn and Smith: for large whenever a Hadamard matrix of order exists [10].
Butson Hadamard matrices
A complex Hadamard matrix of order is an matrix with entries of modulus and ; the character table of is one. The Butson Hadamard matrices of Section 2 are the complex Hadamard matrices with entries in the th roots of unity. The inner product of two rows is a vanishing sum of roots of unity, and the theorem of Lam and Leung [64] shows that a with prime and exists only if . A gives a Hadamard matrix of order [102]. No such condition arises for , and Craigen and Szőllősi constructed a for every prime [97 Theorem 1.4.41]. Tadej and Życzkowski survey complex Hadamard matrices [99], and Szőllősi’s thesis treats the Butson case [97]. A non-existence criterion using algebraic number theory is due to Winterhof [113].
The first was found by Szőllősi, from circulant -matrices of order placed in a modification of a block construction of Kharaghani and Seberry [98], and the first by Kharaghani, Mohammadian, Tayfeh-Rezaie and Zaitsev, from four circulant matrices of order of which three are symmetric [58]. Czifra, Matolcsi and Szőllősi derived a necessary condition for the existence of a from positive definite functions on finite groups, and constructed the first , and [25].
Problem 8 (Fourth roots). Does a exist at every even order ? This is a conjecture of Seberry [97 Conjecture 1.4.11], and it implies the Hadamard conjecture.
Problem 9 (Sixth roots). Does a exist for every prime ? This is a conjecture of Szőllősi [97 Conjecture 1.4.47]. According to [25], the undecided even orders below 100 are 46, 74, 86 and 94, all of this form.
Modular Hadamard matrices
Marrero and Butson defined an -modular Hadamard matrix of order to be an -matrix with [71, 72]. The entries of lie in , so an -modular Hadamard matrix of order is a Hadamard matrix. The -modular Hadamard conjecture asserts that an -modular Hadamard matrix exists at every order divisible by ; the Hadamard conjecture is equivalent to this assertion for infinitely many . It is known for [71, 72], [65] and , and so for their divisors. Eliahou and Kervaire settled using modular Golay quadruples, which give modular Hadamard matrices through the Goethals–Seidel array [43]. Kuperberg settled and at all but finitely many orders [63]. Eliahou and Kervaire survey the subject [44]. Eliahou constructed a -modular Hadamard matrix of order , and announced -modular Hadamard matrices at all orders [42, 41].
Problem 10 (128-modular Hadamard matrices). Does a -modular Hadamard matrix exist at every order divisible by ?
Problem 11 (7-modular Hadamard matrices). Does a -modular Hadamard matrix exist at every order divisible by ?
Asymptotic existence
The asymptotic existence theorems of Seberry and her successors have the following form: there are constants such that for every odd there is a Hadamard matrix of order for every . The Hadamard conjecture is the case , . Seberry showed that one may take [106]. Craigen improved the bound using signed groups [22]; was reduced in stages to [26], and Livinskyi reduced it further [68]. The introduction of [26] summarises these results. De Launey showed that for every the odd for which there is a Hadamard matrix of order form a set of positive density [26]. Paley’s constructions give orders up to at which a Hadamard matrix exists; de Launey and Gordon showed that Kronecker products of Paley matrices give at least , with , and that the other known constructions do not improve this bound [28]. Alexeev, Jasper and Mixon showed that for every and every sufficiently large there is an -matrix with condition number at most , and that for the condition number is at least for an absolute constant [2].
Problem 12 (Arithmetic progressions). Is there an infinite arithmetic progression of positive integers such that a Hadamard matrix of order exists for every ?
Problem 13 (Bounded exponent). Is there an absolute constant such that a Hadamard matrix of order exists for every odd and every ?
Group-developed matrices and Gauss sums
Let be an abelian group of order and exponent , and let . The matrix is a Hadamard matrix if and only if for every character of , where lies in . The existence of group-developed Hadamard matrices is thus a question about algebraic integers of absolute value in a cyclotomic field, and the same holds for Butson Hadamard matrices. Gauss sums are the basic source of such integers. The quadratic Gauss sum underlies Paley’s construction, and evaluations of Gauss and Jacobi sums of higher order give difference sets and strongly regular graphs [115], skew Hadamard difference sets [46], the matrices of large determinant [76], and the group-invariant of Ong and Schmidt [79]. In the other direction, the prime ideal factorisation of an element of absolute value is constrained, and this gives the main nonexistence results, by Turnbull’s self-conjugacy argument [101] and Schmidt’s field descent [84], developed further by Leung and Schmidt [66]. Ryser conjectured that there is no circulant Hadamard matrix of order greater than [82]. Schmidt’s monograph [86] develops these methods in detail. In October 2026
OpenAI released a manuscript, produced by one of its models, that claims a proof of Ryser’s conjecture; its main theorem is formalised in Lean [80].
A difference set in is skew Hadamard if is the disjoint union of , and . The quadratic residues of , , form one, and every known example in an abelian group lies in an elementary abelian group.
Problem 14 (Skew Hadamard difference sets). If an abelian group contains a skew Hadamard difference set, must it be elementary abelian? Momihara showed that one counterexample would give infinitely many [75].
Problem 15 (Momihara, Suda and Xiang). Momihara, Suda and Xiang constructed three families of matrices of order , with a prime power, whose determinants they expressed through Gauss and Jacobi sums without evaluating them [76 Theorem 1.6, Classes (4)–(6)]. Is for every such in each family? They checked that it is for .
A Hadamard matrix is cocyclic over a group of order if it is equivalent to for a 2-cocycle ; when is a coboundary the matrix is equivalent to a group-developed one. The Sylvester and Paley matrices are cocyclic [56, 29].
Problem 16 (Cocyclic Hadamard matrices). Is there a cocyclic Hadamard matrix at every order divisible by 4? This is a conjecture of de Launey and Horadam [56].
Statement of AI Use
The authors used Anthropic’s Claude (Claude Opus 5.5, via Claude Code, September–October 2026) extensively in this work. Claude wrote the Python and C++ programs used to analyse the twelve matrices of [3], to check constructions claimed in the literature and the matrices found by others described in § 4, and to construct the symmetric BH(86, 4), the -matrices of orders 151 and 163, and the Hadamard matrices of orders 5788 and 8476 of § 4. Theorem 7 was formulated from this analysis, then checked and rewritten by hand. Sections of the paper were drafted using Claude, then checked and rewritten by hand. Each section was proof-read by all four authors. Every Hadamard matrix constructed in this paper is publicly available at https://www.math74.com/Hadamard/ and was verified by an exact computation of . The authors take full responsibility for all claims made in this paper.
References
- [1]S. S. Agaian. Hadamard matrices and their applications, volume 1168 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1985.
- [2]B. Alexeev, J. Jasper, and D. G. Mixon. Asymptotically optimal approximate Hadamard matrices, 2025. arXiv:2511.14653.arxiv.org/abs/2511.14653
- [3]L. AlPöge, P. Voinov, and S. Reynolds-Haertle. Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, 2026. Announcement, 12 August 2026; see https://epoch.ai/frontiermath/open-problems/hadamard.
- [4]G. Barba. Intorno al teorema di Hadamard sui determinanti a valore massimo. Giorn. Mat. Battaglini, 71:70–86, 1933.
- [5]L. Baumert, S. W. Golomb, and M. Hall. Discovery of an Hadamard matrix of order 92. Bull. Amer. Math. Soc., 68(3):237–238, 1962.DOI
- [6]L. D. Baumert. Hadamard matrices of orders 116 and 232. Bull. Amer. Math. Soc., 72(2):237, 1966.DOI
- [7]D. Best, D. Ž. Đoković, H. Kharaghani, and H. Ramp. Turyn-type sequences: classification, enumeration, and construction. J. Combin. Des., 21(1):24–35, 2013.DOI
- [8]T. Beth, D. Jungnickel, and H. Lenz. Design theory. Vol. I, volume 69 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1999.
- [9]P. Borwein and R. A. Ferguson. A complete description of Golay pairs for lengths up to 100. Math. Comp., 73(246):967–985, 2004.
- [10]R. P. Brent, J. H. Osborn, and W. D. Smith. Probabilistic lower bounds on maximal determinants of binary matrices. Australas. J. Combin., 66:350–364, 2016.
- [11]C. Bright, I. Kotsireas, A. Heinle, and V. Ganesh. Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT. J. Symbolic Comput., 102:153–172, 2021.
- [12]A. E. Brouwer. Parameters of strongly regular graphs. Online tables, https://aeb.win.tue.nl/graphs/srg/srgtab.html, accessed 16 October 2026.
- [13]A. E. Brouwer. An infinite series of symmetric designs, volume 202 of Afdelינג Zuivere Wiskunde. Mathematisch Centrum, Amsterdam, 1983.
- [14]P. Browne, R. Egan, F. Hegarty, and P. Ó Catháin. A survey of the Hadamard maximal determinant problem. The Electronic Journal of Combinatorics, 28(4), 2021.DOI
- [15]G. Butbaia, P. Vipulanandan, J. Tan, X. Huang, T. Saunders-A’Court, L. Fagan, D. Passaro, M. Tarquini, and S. Gukov. New records for the Hadamard maximal determinant problem in dimensions 51, 107, 111, 115, and 119, 2026. arXiv:2608.22518.arxiv.org/abs/2608.22518
- [16]A. T. Butson. Generalized Hadamard matrices. Proc. Amer. Math. Soc., 13:894–898, 1962.DOI
- [17]M. Cati and D. V. Pasechnik. A database of constructions of Hadamard matrices, 2024. arXiv:2411.18897.arxiv.org/abs/2411.18897
- [18]J. H. E. Cohn. Almost D-optimal designs. Util. Math., 57:121–128, 2000.
- [19]T. Cooley. Middletownbooks/Hadamard. https://github.com/Middletownbooks/Hadamard, 2026. Branch claude/focused-planck-j1645f, October 2026.
- [20]J. Cooper and J. Wallis. A construction for Hadamard arrays. Bull. Austral. Math. Soc., 7:269–277, 1972.DOI
- [21]R. Craigen. Complex Golay sequences. J. Combin. Math. Combin. Comput., 15:161–169, 1994.
- [22]R. Craigen. Signed groups, sequences, and the asymptotic existence of Hadamard matrices. J. Combin. Theory Ser. A, 71(2):241–254, 1995.DOI
- [23]R. Craigen, W. Holzmann, and H. Kharaghani. Complex Golay sequences: structure and applications. Discrete Math., 252:73–89, 2002.DOI
- [24]R. Craigen, J. Seberry, and X. M. Zhang. Product of four Hadamard matrices. J. Combin. Theory Ser. A, 59(2):318–320, 1992.DOI
- [25]D. Czifra, M. Matolcsi, and F. Szöllősi. A nonexistence criterion and new constructions for Butson Hadamard matrices. J. Algebraic Combin., 64(2):Paper No. 29, 15, 2026.arxiv.org/abs/2511.11230
- [26]W. de Launey. On the asymptotic existence of Hadamard matrices. J. Combin. Theory Ser. A, 116(4):1002–1008, 2009.DOI
- [27]W. de Launey and D. Flannery. Algebraic design theory. Mathematical Surveys and Monographs, vol. 175. American Mathematical Society, Providence, RI, 2011.
- [28]W. de Launey and D. M. Gordon. On the density of the set of known Hadamard orders. Cryptogr. Commun., 2(2):233–246, 2010.
- [29]W. de Launey and R. M. Stafford. On cocyclic weighing matrices and the regular group actions of certain Paley matrices. Discrete Appl. Math., 102(1-2):63–101, 2000. Coding, cryptography and computer security (Lethbridge, AB, 1998).
- [30]D. Ž. Đoković. Construction of some new Hadamard matrices. Bull. Austral. Math. Soc., 45(2):327–332, 1992.
- [31]D. Ž. Đoković. Good matrices of orders 33, 35 and 127 exist. J. Combin. Math. Combin. Comput., 14:145–152, 1993.
- [32]D. Ž. Đoković. Williamson matrices of order 4n for n = 33, 35, 39. Discrete Math., 115:267–271, 1993.
- [33]D. Ž. Đoković. Two Hadamard matrices of order 956 of Goethals–Seidel type. Combinatorica, 14(3):375–377, 1994.
- [34]D. Ž. Đoković. Hadamard matrices of order 764 exist. Combinatorica, 28(4):487–489, 2008.DOI
- [35]D. Ž. Đoković. Small orders of Hadamard matrices and base sequences, 2010. arXiv:1008.2043.
- [36]D. Ž. Đoković. Hadamard matrices: skew of orders 276, 292 and symmetric 372, 2023. arXiv:2301.02751.
- [37]D. Ž. Đoković, O. Golubitsky, and I. S. Kotsireas. Some new orders of Hadamard and skew-Hadamard matrices. J. Combin. Des., 22(6):270–277, 2014.DOI
- [38]D. Ž. Đoković and I. S. Kotsireas. Compression of periodic complementary sequences and applications. Des. Codes Cryptogr., 74(2):365–377, 2015.
- [39]D. Ž. Đoković and I. S. Kotsireas. Some new periodic Golay pairs. Numer. Algorithms, 69(3):523–530, 2015.
- [40]H. Ehlich. Determinantenabschätzungen für binäre Matrizen. Math. Z., 83:123–132, 1964.
- [41]S. Eliahou. Personal communication.
- [42]S. Eliahou. A 64-modular Hadamard matrix of order 668. Australas. J. Combin., 93(2):422–427, 2025.
- [43]S. Eliahou and M. Kervaire. Modular sequences and modular Hadamard matrices. J. Combin. Des., 9(3):187–214, 2001.DOI
- [44]S. Eliahou and M. Kervaire. A survey on modular Hadamard matrices. Discrete Math., 302(1–3):85–106, 2005.DOI
- [45]S. Eliahou, M. Kervaire, and B. Saffari. A new restriction on the lengths of Golay complementary sequences. J. Combin. Theory Ser. A, 55(1):49–59, 1990.DOI
- [46]T. Feng and Q. Xiang. Cyclotomic constructions of skew Hadamard difference sets. J. Combin. Theory Ser. A, 119(1):245–256, 2012.arxiv.org/abs/1101.2994
- [47]R. J. Fletcher, M. Gysin, and J. Seberry. Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices. Australas. J. Combin., 23:75–86, 2001.
- [48]A. V. Geramita and J. Seberry. Orthogonal Designs: Quadratic Forms and Hadamard Matrices. Marcel Dekker, New York, 1979.
- [49]J.-M. Goethals and J. J. Seidel. A skew Hadamard matrix of order 36. J. Austral. Math. Soc., 11:343–344, 1970.
- [50]M. J. E. Golay. Complementary series. IRE Trans. Inform. Theory, IT-7:82–87, 1961.DOI
- [51]O. Gritsenko. On strongly regular graph with parameters (65, 32, 15, 16), 2021. arXiv:2102.05432.
- [52]J. Hadamard. Résolution d’une question relative aux déterminants. Bull. Sci. Math., 17:240–246, 1893.DOI
- [53]M. Hall, Jr. Combinatorial theory. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons Inc., New York, second edition, 1986.
- [54]A. Hedayat and W. D. Wallis. Hadamard matrices and their applications. Ann. Statist., 6(6):1184–1238, 1978.DOI
- [55]W. H. Holzmann, H. Kharaghani, and B. Tayfeh-Rezaie. Williamson matrices up to order 59. Des. Codes Cryptogr., 46(3):343–352, 2008.
- [56]K. J. Horadam. Hadamard matrices and their applications. Princeton University Press, Princeton, NJ, 2007.
- [57]J. D. Jones. Hadamard-T: T-matrix witnesses and the Hadamard orders they close. https://github.com/JD-Jones-ASES/Hadamard-T, 2026. Version 0.1.0, 29 August 2026.
- [58]H. Kharaghani, A. Mohammadian, and B. Tayfeh-Rezaie. A search for Hadamard matrices of Williamson type, 2026. arXiv:2605.08661.arxiv.org/abs/2605.08661
- [59]H. Kharaghani and B. Tayfeh-Rezaie. A Hadamard matrix of order 428. J. Combin. Des., 13(6):435–440, 2005.DOI
- [60]I. Kotsireas, R. Gallardo-Cava, A. I. Gómez, and D. Gómez-Pérez. On the search of binary Legendre pairs of length pq². J. Symbolic Comput., 138:Paper No. 102606, 20, 2027.
- [61]C. Koukouvinos and S. Stylianou. On skew-Hadamard matrices. Discrete Math., 308(13):2723–2731, 2008.DOI
- [62]K. Kumar. New Hadamard matrices. https://github.com/vatskishan03/Hadamard, 2026. Commit 2d45dbb, 18 October 2026.
- [63]V. Kuperberg. Hadamard matrices modulo p and small modular Hadamard matrices. J. Combin. Des., 24(9):393–405, 2016.
- [64]T. Y. Lam and K. H. Leung. On vanishing sums of roots of unity. J. Algebra, 224(1):91–109, 2000.DOI
- [65]M. H. Lee and F. Szőllősi. Hadamard matrices modulo 5. J. Combin. Des., 22(4):171–178, 2014.
- [66]K. H. Leung and B. Schmidt. New restrictions on possible orders of circulant Hadamard matrices. Des. Codes Cryptogr., 64(1-2):143–151, 2012.
- [67]S. Li, K. Momihara, and Q. Xiang. New constructions of square (±1)-matrices with large determinants. Linear Algebra Appl., 752:66–106, 2027.
- [68]I. Livinskiyi. Asymptotic existence of Hadamard matrices, M.Sc. Thesis. University of Manitoba, 2012.
- [69]S. London and I. Kotsireas. New Turyn-type sequences. Cryptogr. Commun., 17(5):1601–1610, 2025.DOI
- [70]S. London and I. Kotsireas. Further results on Turyn-type sequences. Submitted, 2026.
- [71]O. Marrero and A. T. Butson. Modular Hadamard matrices and related designs. II. Canad. J. Math., 24(6):1100–1109, 1972.DOI
- [72]O. Marrero and A. T. Butson. Modular Hadamard matrices and related designs. J. Combin. Theory Ser. A, 15(3):257–269, 1973.
- [73]R. Mathon. Symmetric conference matrices of order pq² + 1. Canad. J. Math., 30(2):321–331, 1978.DOI
- [74]M. Miyamoto. A construction of Hadamard matrices. J. Combin. Theory Ser. A, 57(1):86–108, 1991.DOI
- [75]K. Momihara. A recursive construction for skew Hadamard difference sets. Electron. J. Combin., 27(3):Paper No. 3.36, 2020.DOI
- [76]K. Momihara, S. Suda, and Q. Xiang. Square (1, −1)-matrices with large determinants and near-Hadamard matrices. Linear Algebra Appl., 654:28–55, 2022.
- [77]K. Momihara and M. Yamada. Divisible difference families from Galois rings GR(4,n) and Hadamard matrices. Des. Codes Cryptogr., 73(3):897–909, 2014.
- [78]G. Nuñez Ponasso. Maximal determinants of matrices over the roots of unity. Linear Algebra Appl., 723:201–243, 2025.arxiv.org/abs/2503.11114
- [79]C. Y. Ong and B. Schmidt. Butson Hadamard matrices from pairs of Gauss sums, 2026. arXiv:2609.22754.arxiv.org/abs/2609.22754
- [80]OpenAI. The circulant Hadamard conjecture. Model-generated manuscript, family 179, https://github.com/openai/math, 2026. Released 6 October 2026; main theorem formalised in Lean.hub.valency.io/works/W_xcu3hkq8
- [81]R. Paley. On orthogonal matrices. J. Math. Phys., 12:311–320, 1933.DOI
- [82]H. J. Ryser. Combinatorial mathematics. The Carus Mathematical Monographs, No. 14. Published by The Mathematical Association of America, 1963.
- [83]K. Sawade. A Hadamard matrix of order 268. Graphs Combin., 1:185–187, 1985.DOI
- [84]B. Schmidt. Cyclotomic integers and finite geometry. J. Amer. Math. Soc., 12(4):929–952, 1999.DOI
- [85]B. Schmidt. Williamson matrices and a conjecture of Ito’s. Des. Codes Cryptogr., 17(1-3):61–68, 1999.DOI
- [86]B. Schmidt. Characters and Cyclotomic Fields in Finite Geometry, volume 1797 of Lecture Notes in Mathematics. Springer, Berlin, 2002.DOI
- [87]L. Schneider. hadamard-2060. https://github.com/schneiderlo/hadamard-2060, 2026. T-matrices of order 103; included in SageMath, pull request #42876, October 2026.
- [88]A. Schumer. Periodic T-matrices of order 151 and a skew spin Goethals–Seidel family over ℤ/19ℤ: certificates and Hadamard constructions of orders 3676, 5436, 6644, and 7852. Zenodo, https://doi.org/10.5281/zenodo.2282997, 2026. Version 1.0.0, 17 September 2026.
- [89]J. Seberry. A computer listing of Hadamard matrices. In Combinatorial Mathematics (Proc. Internat. Conf., Canberra, 1977), volume 686 of Lecture Notes in Math., pages 275–281. Springer, Berlin, 1978.DOI
- [90]J. Seberry and A. L. Whiteman. New Hadamard matrices and conference matrices obtained via Mathon’s construction. Graphs Combin., 4:355–377, 1988.DOI
- [91]J. Seberry and M. Yamada. On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures. J. Combin. Math. Combin. Comput., 7:97–137, 1990.
- [92]J. Seberry and M. Yamada. Hadamard matrices, sequences, and block designs. In Contemporary design theory, Wiley-Intersci. Ser. Discrete Math. Optim., pages 431–560. Wiley, New York, 1992.
- [93]J. Seberry and M. Yamada. Hadamard matrices–constructions using number theory and algebra. John Wiley & Sons, Inc., Hoboken, NJ, 2020.
- [94]E. Spence. Skew-Hadamard matrices of the Goethals–Seidel type. Canadian J. Math., 27(3):555–560, 1975.DOI
- [95]T. Storer. Cyclotomy and difference sets. Lectures in Advanced Mathematics, No. 2. Markham Publishing Co., Chicago, Ill., 1967.
- [96]J. Sylvester. Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton’s rule, ornamental tile-work, and the theory of numbers. Phil. Mag., 34(1):461–475, 1867.
- [97]F. Szöllősi. Construction, classification and parametrization of complex Hadamard matrices. PhD thesis, Central European University, 2011. arXiv:1110.5590.arxiv.org/abs/1110.5590
- [98]F. Szöllősi. A complex Hadamard matrix of order 94. J. Combin. Theory Ser. A, 225:Paper No. 106254, 2027.arxiv.org/abs/2603.09572
- [99]W. Tadej and K. Życzkowski. A concise guide to complex Hadamard matrices. Open Syst. Inf. Dyn., 13(2):133–177, 2006.DOI
- [100]H. Tamura. D-optimal designs and group divisible designs. J. Combin. Des., 14(6):451–462, 2006.
- [101]R. J. Turyn. Character sums and difference sets. Pacific J. Math., 15:319–346, 1965.DOI
- [102]R. J. Turyn. Complex Hadamard matrices. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 435–437. Gordon and Breach, New York, 1970.
- [103]R. J. Turyn. An infinite class of Williamson matrices. J. Combin. Theory Ser. A, 12:319–321, 1972.DOI
- [104]R. J. Turyn. Hadamard matrices, Baumert–Hall units, four-symbol sequences, pulse compression, and surface wave encodings. J. Combin. Theory Ser. A, 16:313–333, 1974.DOI
- [105]H. Verma. A symmetric conference matrix of order 86, 2026. arXiv:2610.08893.
- [106]J. S. Wallis. On the existence of Hadamard matrices. J. Combinatorial Theory Ser. A, 21(2):188–195, 1976.DOI
- [107]W. D. Wallis, A. P. Street, and J. S. Wallis. Combinatorics: Room squares, sum-free sets, Hadamard matrices. Lecture Notes in Mathematics, Vol. 292. Springer-Verlag, Berlin-New York, 1972.DOI
- [108]X. Wang and J. Zhu. On base, normal and near-normal sequences, 2025. arXiv:2506.20296.arxiv.org/abs/2506.20296
- [109]A. L. Whiteman. An infinite family of Hadamard matrices of Williamson type. J. Combin. Theory Ser. A, 14(3):334–340, 1973.DOI
- [110]A. L. Whiteman. A family of D-optimal designs. Ars Combin., 30:23–26, 1990.
- [111]G. Williamson, O. Yacobi, and P. Zinn-Justin. Generating Hadamard matrices with transformers, 2026. arXiv:2604.11101.
- [112]J. Williamson. Hadamard’s determinant theorem and the sum of four squares. Duke Math. J., 11:65–81, 1944.DOI
- [113]A. Winterhof. On the non-existence of generalized Hadamard matrices. J. Statist. Plann. Inference, 84(1-2):337–342, 2000.DOI
- [114]M. Wojtas. On Hadamard’s inequality for the determinants of order non-divisible by 4. Colloq. Math., 12(1):73–83, 1964.DOI
- [115]Q. Xiang. Cyclotomy, Gauss sums, difference sets and strongly regular Cayley graphs. In Sequences and their applications—SETA 2012, volume 7280 of Lecture Notes in Comput. Sci., pages 245–256. Springer, Heidelberg, 2012.DOI
- [116]M. Yamada. Some new series of Hadamard matrices. J. Austral. Math. Soc. Ser. A, 46(3):371–383, 1989.
- [117]M. Yamada. Hadamard matrices of generalized quaternion type. Discrete Math., 87(2):187–196, 1991.DOI
- [118]C. H. Yang. On composition of four-symbol δ-codes and Hadamard matrices. Proc. Amer. Math. Soc., 107(3):763–776, 1989.
- [119]V. Zaitsev, H. Kharaghani, A. Mohammadian, and B. Tayfeh-Rezaie. Quaternary Hadamard matrices. https://www.cs.uleth.ca/~zaitsev/quaternary.html, 2026. Last updated 14 October 2026.DOI