Numerical evidence for the almost Hadamard conjecture

We report numerical evidence for the almost Hadamard conjecture, which states that every local maximizer of the entrywise 1-norm on the unitary group U_N has all entries of modulus 1/sqrt(N), or equivalently that every complex almost Hadamard matrix is a complex Hadamard matrix. We study orders 4 and 5 through structural results, numerical searches and interval certificates. At order 5, we certify exact critical points near 40 nonflat representatives, local uniqueness modulo phases and Hessian inertia, obtaining at least 35 distinct nonflat critical values. These results support the conjecture without proving it in these orders. This release contains the 30-page paper, its TeX source, 28 Python programs, certificate inputs and selected computational data. The manuscript byline is Chat, Grok and Teo.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24357391
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Numerical evidence for the almost Hadamard conjecture

Teodor Banica, Grok, Chat
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

Numerical evidence for the almost Hadamard conjecture

Teodor Banica, Grok, Chat
preprint en

Abstract

We report numerical evidence for the almost Hadamard conjecture, which states that every local maximizer of the entrywise 1-norm on the unitary group U_N has all entries of modulus 1/sqrt(N), or equivalently that every complex almost Hadamard matrix is a complex Hadamard matrix. We study orders 4 and 5 through structural results, numerical searches and interval certificates. At order 5, we certify exact critical points near 40 nonflat representatives, local uniqueness modulo phases and Hessian inertia, obtaining at least 35 distinct nonflat critical values. These results support the conjecture without proving it in these orders. This release contains the 30-page paper, its TeX source, 28 Python programs, certificate inputs and selected computational data. The manuscript byline is Chat, Grok and Teo.

Zenodo (CERN European Organization for Nuclear Research)
CY Cergy Paris Université (FR)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon