The discrepancy of Sylvester-Hadamard matrices in odd dimension
Let $H_k$ be the $2^k\times 2^k$ Sylvester–Hadamard matrix and let $\operatorname{disc}(H_k)$ be the minimum of $\|H_kx\|_\infty$ over sign vectors $x$. It is known that $\operatorname{disc}(H_k)=2^{k/2}$ for even $k$, and it has been conjectured that $\operatorname{disc}(H_k)=2^{(k+1)/2}$ for every odd $k$. We show that $\operatorname{disc}(H_k)=2^k-2\rho(1,k)$, where $\rho(1,k)$ is the covering radius of the first-order Reed–Muller code of length $2^k$. Known values and bounds for this covering radius then show that the conjecture holds for $k\le 7$ and fails for every odd $k\ge 9$; in fact $\operatorname{disc}(H_k)\le \tfrac78\,2^{(k+1)/2}$ for every odd $k\ge 9$. Determining $\operatorname{disc}(H_k)$ for odd $k\ge 9$ is therefore equivalent to determining $\rho(1,k)$.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-08
- DOI
- https://doi.org/10.5281/zenodo.24064367
- Primary Topic
- Coding theory and cryptography
- Type
- preprint