A proof of Ryser's circulant Hadamard conjecture
math.CO, math.NT
Submitted: 2023-02-16
Updated: 2026-10-30
Comments: Error found by AI. Corrected proof may be found here: https://github.com/openai/math/tree/main/preprints/The-circulant-Hadamard-conjecture-September-23-2026
License: http://creativecommons.org/licenses/by/4.0/
The gist: We show that an n times n circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when n at most 4…
Abstract
We show that an n times n circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when n at most 4, proving Ryser's 1963 conjecture that no such matrices exist for n>4.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality