Advertisement
Published in:
01-09-2010
On the density of the set of known Hadamard orders
Published in: Cryptography and Communications | Issue 2/2010
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Let S(x) be the number of n ≤ x for which a Hadamard matrix of order n exists. Hadamard’s conjecture states that S(x) is about x/4. From Paley’s constructions of Hadamard matrices, we have that
In a recent paper, the first author suggested that counting the products of orders of Paley matrices would result in a greater density. In this paper we use results of Kevin Ford to show that it does:
where C = 0.8178....
$$ S(x) = \Omega\left( \frac{x}{\log x} \right). $$
$$S(x) \geq \frac{x}{\log x} \exp\left((C+o(1))(\log \log \log x)^2 \right)\,, $$
This bound is surprisingly hard to improve upon. We show that taking into account all the other major known construction methods for Hadamard matrices does not shift the bound. Our arguments use the notion of a (multiplicative) monoid of natural numbers. We prove some initial results concerning these objects. Our techniques may be useful when assessing the status of other existence questions in design theory.