Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964

Primarily AI-generated textHuman understanding: some partsmath.CO — Combinatoricsmath.IT — Information Theorycs.DM — Discrete Mathematics

Contributed by Erisa Hasani, Abhinav Nellore ↗, Rachel Ward

Version 1 / Nov 19, 2026 / CC0 1.0

Abstract

We construct Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, the twelve multiples of 4 below 2000 for which none was known, and a second, inequivalent matrix of order 668. Five come from the Goethals–Seidel array with circulant blocks invariant under a multiplier group, four from the width-4 bordered array of Wallis and Whiteman, and four from bordered Goethals–Seidel arrays of widths 12, 20 and 28 whose corner is itself a Hadamard matrix. To our knowledge borders wider than 4 with a Hadamard corner are new; the first two arrays are classical. The four matrices with a border of width 4, of orders 668, 716, 1676 and 1772, are instances of a theorem of Miyamoto on Hadamard matrices of order 8m+48m+4, which Seberry and Yamada restated with their M-structures; the matrices to which the theorem applies were found here by computer search. The searches differ greatly in size. Those for the wider borders formed at most about 2442^{44} pairs of candidate blocks. Those for orders 716 and 668 with a border of width 4, made with no multiplier group, formed about 2662^{66} and 2592^{59}, and these two matrices, that of order 716 above all, are results of large-scale computation more than of a new construction. With these matrices, a Hadamard matrix of order nn is known for every n≡0(mod4)n\equiv 0\pmod 4 with n≤2000n\le 2000.

Author comments: 28 pages. The source also builds a marked copy showing every change from the original write-up (instructions at the top of the TeX file). The timing program of Appendix D, pairsum_bench.c, is at the end of the TeX source.

Provenance statement

The constructions, searches, proofs, programs and text of this paper are the work of Claude, an AI system made by Anthropic, supervised by Levent Alpöge, Saul Reynolds-Haertle and Philippe Voinov, who announced the twelve matrices with data on 12 August 2026 (reference [1] of the paper). The text was afterwards edited by Claude (Opus 5.5, Fable 5.1 and Fable 5.2) working with Erisa Hasani, Abhinav Nellore and Rachel Ward, who proposed corrections of attribution and of emphasis. The editing was done from the text and the printed data, without the search programs or their logs. The re-run of the constructions on the printed tables (§6.1), the timing program and the cost estimates of Appendix D date from the editing and were produced by Claude. Erisa Hasani, Abhinav Nellore and Rachel Ward have studied the paper, and they follow its constructions and the main lines of its proofs; they have not repeated the searches or worked through every computation reported in it. This deposit is not a publication of Anthropic. Erisa Hasani, Abhinav Nellore and Rachel Ward received no payment from Anthropic for their work on this paper and signed no non-disclosure agreement. They were given access to the original write-up on 9 October 2026, and a revision was returned on 27 October 2026. This version revises it further.

Tools used

Anthropic
Claude OpusVersion 5.5
Anthropic
Claude FableVersion 5.1
Anthropic
Claude FableVersion 5.2

References

  1. 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, announcement with data, 12 August 2026; see https://epoch.ai/frontiermath/open-problems/hadamard.link
  2. L. D. Baumert and D. M. Gordon, On the existence of cyclic difference sets with small parameters, in: High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams , Fields Inst. Commun. 41, Amer. Math. Soc., 2004, 61--68; arXiv:math/0304502.arXiv
  3. J. Bernasconi, Low autocorrelation binary sequences: statistical mechanics and configuration space analysis, J. Physique 48 (1987) 559--567.
  4. D. Best, D. Ž. oković, H. Kharaghani and H. Ramp, Turyn-type sequences: classification, enumeration, and construction, J. Combin. Des. 21 (2013) 24--35.
  5. T. Beth, D. Jungnickel and H. Lenz, Design Theory , Vol. I, 2nd ed., Encyclopedia Math. Appl. 69, Cambridge University Press, 1999.
  6. C. Bright, I. S. Kotsireas and V. Ganesh, Applying computer algebra systems with SAT solvers to the Williamson conjecture, J. Symbolic Comput. 100 (2020) 187--209.
  7. M. Cati and D. V. Pasechnik, A database of constructions of Hadamard matrices, arXiv:2411.18897v2, 2025.arXiv
  8. M. Chiarandini, I. S. Kotsireas, C. Koukouvinos and L. Paquete, Heuristic algorithms for Hadamard matrices with two circulant cores, Theoret. Comput. Sci. 407 (2008) 274--277.
  9. T. Cooley, Hadamard matrices from Claude Code searches, GitHub repository, https://github.com/Middletownbooks/Hadamard, 2026.link
  10. J. Cooper, J. Milas and W. D. Wallis, Hadamard equivalence, in: Combinatorial Mathematics (Canberra 1977), Lecture Notes in Math. 686, Springer, 1978, 126--135.
Show all 83 referencesShow fewer references
  1. J. Cooper and J. Wallis, A construction for Hadamard arrays, Bull. Austral. Math. Soc. 7 (1972) 269--277.
  2. R. Craigen and H. Kharaghani, Hadamard matrices and Hadamard designs, in: Handbook of Combinatorial Designs , Chapman & Hall/CRC, 2007, 273--280.
  3. W. de Launey and D. L. Flannery, Algebraic Design Theory , Math. Surveys Monogr. 175, Amer. Math. Soc., 2011.
  4. D. Ž. oković, Construction of some new Hadamard matrices, Bull. Austral. Math. Soc. 45 (1992) 327--332.
  5. D. Ž. oković, Williamson matrices of order 4n4n for n=33,35,39n=33,35,39, Discrete Math. 115 (1993) 267--271.
  6. D. Ž. oković, Two Hadamard matrices of order 956 of Goethals--Seidel type, Combinatorica 14 (1994) 375--377.
  7. D. Ž. oković, Hadamard matrices of order 764 exist, Combinatorica 28 (2008) 487--489.
  8. D. Ž. oković, Supplementary difference sets with symmetry for Hadamard matrices, Oper. Matrices 3 (2009) 557--569.
  9. D. Ž. oković, Two classes of Hadamard matrices of Goethals--Seidel type, arXiv:2404.14375v3, 2024.arXiv
  10. D. Ž. oković, O. Golubitsky and I. S. Kotsireas, Some new orders of Hadamard and skew-Hadamard matrices, J. Combin. Des. 22 (2014) 270--277.
  11. D. Ž. oković and I. S. Kotsireas, Compression of periodic complementary sequences and applications, Des. Codes Cryptogr. 74 (2015) 365--377.
  12. D. Ž. oković and I. S. Kotsireas, Computational methods for difference families in finite abelian groups, Spec. Matrices 7 (2019) 127--141.
  13. R. Egan, I. S. Kotsireas, S. London and P. Ó Catháin, Recent progress in the construction of Hadamard matrices, arXiv:2610.27175v1, 2026.arXiv
  14. S. Eliahou, A 64-modular Hadamard matrix of order 668, Australas. J. Combin. 93(2) (2025) 422--427.
  15. J. E. H. Elliott and A. T. Butson, Relative difference sets, Illinois J. Math. 10 (1966) 517--531.
  16. 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 (2001) 75--86.
  17. D. Gale, A theorem on flows in networks, Pacific J. Math. 7 (1957) 1073--1082.
  18. A. V. Geramita and J. Seberry, Orthogonal Designs: Quadratic Forms and Hadamard Matrices , Marcel Dekker, New York, 1979.
  19. J. M. Goethals and J. J. Seidel, A skew Hadamard matrix of order 36, J. Austral. Math. Soc. 11 (1970) 343--344.
  20. M. Gysin and J. Seberry, An experimental search and new combinatorial designs via a generalisation of cyclotomy, J. Combin. Math. Combin. Comput. 27 (1998) 143--160.
  21. J. Hadamard, Résolution d'une question relative aux déterminants, Bull. Sci. Math. 17 (1893) 240--246.
  22. W. H. Holzmann, H. Kharaghani and B. Tayfeh-Rezaie, Williamson matrices up to order 59, Des. Codes Cryptogr. 46 (2008) 343--352.
  23. K. J. Horadam, Hadamard Matrices and Their Applications , Princeton University Press, 2007.
  24. D. C. Hunt and J. Wallis, Cyclotomy, Hadamard arrays and supplementary difference sets, Congr. Numer. 7 (1973) 351--381.
  25. J. D. Jones, Hadamard-T: T-matrix witnesses and the Hadamard orders they close, GitHub repository, https://github.com/JD-Jones-ASES/Hadamard-T, version 0.1.0, 29 August 2026.link
  26. H. Kharaghani and B. Tayfeh-Rezaie, A Hadamard matrix of order 428, J. Combin. Des. 13 (2005) 435--440.
  27. I. S. Kotsireas, Structured Hadamard conjecture, in: Number Theory and Related Fields: In Memory of Alf van der Poorten , Springer Proc. Math. Stat. 43, Springer, 2013, 215--227.
  28. I. S. Kotsireas, R. Gallardo-Cava, A. I. Gómez and D. Gómez-Pérez, On the search of binary Legendre pairs of length pq2pq^2, J. Symbolic Comput. 138 (2027) 102606.
  29. I. S. Kotsireas, C. Koukouvinos, P. M. Pardalos and O. V. Shylo, Periodic complementary binary sequences and combinatorial optimization algorithms, J. Comb. Optim. 20 (2010) 63--75.
  30. I. S. Kotsireas, C. Koukouvinos and J. Seberry, Hadamard ideals and Hadamard matrices with two circulant cores, European J. Combin. 27 (2006) 658--668.
  31. I. S. Kotsireas, C. Koukouvinos and J. Seberry, Weighing matrices and string sorting, Ann. Comb. 13 (2009) 305--313.
  32. I. S. Kotsireas and C. Koutschan, Legendre pairs of lengths ℓ≡0(mod3)\ell\equiv0\pmod3, J. Combin. Des. 29 (2021) 870--887.
  33. I. S. Kotsireas, C. Koutschan, D. A. Bulutoglu, D. M. Arquette, J. S. Turner and K. J. Ryan, Legendre pairs of lengths ℓ≡0(mod5)\ell\equiv0\pmod5, Spec. Matrices 11 (2023) 20230105.
  34. I. S. Kotsireas, C. Koutschan and A. Winterhof, Quaternary Legendre pairs II, Discrete Math. 348 (2025), no. 9, 114501.
  35. K. Kumar, New Hadamard matrices, GitHub repository, https://github.com/vatskishan03/Hadamard, version 2.1.0, 29 October 2026.link
  36. E. S. Lander, Symmetric Designs: An Algebraic Approach , London Math. Soc. Lecture Note Ser. 74, Cambridge University Press, 1983.
  37. K. H. Leung and K. Momihara, New constructions of Hadamard matrices, J. Combin. Theory Ser. A 171 (2020) 105160.
  38. K. H. Leung, K. Momihara and Q. Xiang, A new family of Hadamard matrices of order 4(2q2+1)4(2q^2+1), Discrete Math. 344 (2021) 112163.
  39. S. London, Constructing New Turyn Type Sequences, T-Sequences and Hadamard Matrices , PhD thesis, University of Illinois at Chicago, 2013.
  40. S. London and I. S. Kotsireas, New Turyn-type sequences, Cryptogr. Commun. 17 (2025) 1601--1610.
  41. L. Lou, M. Xia and T. Xia, On T-matrices of order 6m+16m+1, Adv. Appl. Discrete Math. 21 (2019), no. 2, 163--181.
  42. T. Lumsden, I. S. Kotsireas and C. Bright, New results on periodic Golay pairs, Math. Comp. 95 (2026) 1517--1539.
  43. A. I. Medianik, Regular simplex inscribed into a cube and Hadamard matrix of half-circulant type, Mat. Fiz. Anal. Geom. 4 (1997) 458--471 (in Russian).
  44. A. I. Medianik, Regular simplex inscribed into a cube, half-circulant Hadamard matrices and Gaussian sums, Mat. Fiz. Anal. Geom. 8 (2001) 58--81 (in Russian).
  45. S. Mertens and C. Bessenrodt, On the ground states of the Bernasconi model, J. Phys. A 31 (1998) 3731--3749.
  46. M. Miyamoto, A construction of Hadamard matrices, J. Combin. Theory Ser. A 57 (1991) 86--108.
  47. K. Momihara and M. Yamada, Divisible difference families from Galois rings GR(4,n)GR(4,n) and Hadamard matrices, Des. Codes Cryptogr. 73 (2014) 897--909.
  48. OEIS Foundation Inc., Number of Hadamard matrices of order 4n4n (whose notes record the orders for which none is known), Entry A007299 in The On-Line Encyclopedia of Integer Sequences , https://oeis.org/A007299, accessed 2026.link
  49. R. E. A. C. Paley, On orthogonal matrices, J. Math. Phys. 12 (1933) 311--320.
  50. A. F. Ramos, D. B. Hulak and R. J. G. B. de Queiroz, Multiplier obstructions for Legendre pairs of length 333, J. Combin. Des. , published online 28 October 2026, doi:10.1002/jcd.70044; arXiv:2607.20765 v1, 2026 v2 .arXivDOI
  51. H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957) 371--377.
  52. L. Schneider, hadamard-2060, GitHub repository, https://github.com/schneiderlo/hadamard-2060, 2026.link
  53. A. Schumer, Periodic T-matrices of order 151 and a skew spin Goethals--Seidel family over Z/919Z\Z/919\Z: certificates and Hadamard constructions of orders 3676, 5436, 6644 and 7852, Zenodo, https://doi.org/10.5281/zenodo.22820997, version 1.0.0, 17 September 2026.DOI
  54. 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 (1990) 97--137.
  55. J. Seberry and M. Yamada, Hadamard matrices, sequences, and block designs, in: Contemporary Design Theory: A Collection of Surveys , Wiley, 1992, 431--560.
  56. J. Seberry and M. Yamada, On the multiplication theorems of Hadamard matrices of generalized quaternion type using M-structures, J. Combin. Math. Combin. Comput. 13 (1993) 97--106.
  57. J. Seberry and M. Yamada, Hadamard Matrices: Constructions using Number Theory and Algebra , Wiley, 2020.
  58. E. Spence, Hadamard matrices from relative difference sets, J. Combin. Theory Ser. A 19 (1975) 287--300.
  59. A. B. Suksmono and Y. Minato, Quantum computing formulation of some classical Hadamard matrix searching methods and its implementation on a quantum computer, Sci. Rep. 12 (2022), doi:10.1038/s41598-021-03586-0.DOI
  60. G. Szekeres, Tournaments and Hadamard matrices, Enseign. Math. 15 (1969) 269--278.
  61. G. Szekeres, A skew Hadamard matrix of order 52, Canad. J. Math. 21 (1969) 1319--1322.
  62. J. S. Turner, I. S. Kotsireas, D. A. Bulutoglu and A. J. Geyer, A Legendre pair of length 77 using complementary binary matrices with fixed marginals, Des. Codes Cryptogr. 89 (2021) 1321--1333.
  63. R. J. Turyn, Character sums and difference sets, Pacific J. Math. 15 (1965) 319--346.
  64. R. J. Turyn, An infinite class of Williamson matrices, J. Combin. Theory Ser. A 12 (1972) 319--321.
  65. R. J. Turyn, Hadamard matrices, Baumert--Hall units, four-symbol sequences, pulse compression, and surface wave encodings, J. Combin. Theory Ser. A 16 (1974) 313--333.
  66. J. Wallis and A. L. Whiteman, Some classes of Hadamard matrices with constant diagonal, Bull. Austral. Math. Soc. 7 (1972) 233--249.
  67. W. D. Wallis, A. P. Street and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices , Lecture Notes in Math. 292, Springer, 1972.
  68. A. L. Whiteman, Hadamard matrices of order 4(2p+1)4(2p+1), J. Number Theory 8 (1976) 1--11.
  69. G. Williamson, O. Yacobi and P. Zinn-Justin, Generating Hadamard matrices with transformers, arXiv:2604.11101v2, 2026.arXiv
  70. J. Williamson, Hadamard's determinant theorem and the sum of four squares, Duke Math. J. 11 (1944) 65--81.
  71. M. Xia, T. Xia, J. Seberry and H. Qin, Construction of T-matrices of order 6m+16m+1, Far East J. Math. Sci. 101 (2017), no. 8, 1731--1749.
  72. M. Yamada, Some new series of Hadamard matrices, J. Austral. Math. Soc. Ser. A 46 (1989) 371--383.
  73. Supplementary data for this paper (sequences, blocks, frames, matrices and scripts). Not publicly deposited.

Version history

  1. v1 · 28 pagesSubmitted by Abhinav Nellore28 pages. The source also builds a marked copy showing every change from the original write-up (instructions at the top of the TeX file). The timing program of Appendix D, pairsum_bench.c, is at the end of the TeX source.CurrentNov 19, 2026