ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H(n)H(n) denote the number of Hadamard matrices of order nn. If a Hadamard matrix of order nn exists, permuting its rows and columns already gives at least (n!)2(n!)^2 distinct Hadamard matrices. The growth-rate conjecture. For any n=4mn=4m with m∈Nm\in\mathbb{N},

H(n)=2O(nlog⁡n).H(n)=2^{O(n\log n)}.

The Hadamard conjecture would provide a lower bound of order 2Ω(nlog⁡n)2^{\Omega(n\log n)} for every multiple of 44, while the paper proves a nontrivial upper bound of the form 2(1−cH)n2/22^{(1-c_H)n^2/2} for some absolute cH>0c_H>0. The conjectured near-minimal growth remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.