English

On the Asymptotic Existence of Hadamard Matrices

Combinatorics 2010-03-23 v1 Number Theory

Abstract

It is conjectured that Hadamard matrices exist for all orders 4t4t (t>0t>0). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural numbers kk, there is a Hadamard matrix of order k2[a+blog2k]k2^{[a+b\log_2k]}, where aa and bb are fixed non-negative constants. To prove the Hadamard Conjecture, it is sufficient to show that we may take a=2a=2 and b=0b=0. Since Seberry's ground-breaking result, which showed that we may take a=0a=0 and b=2b=2, there have been several improvements where bb has been by stages reduced to 3/8. In this paper, we show that for all ϵ>0\epsilon>0, the set of odd numbers kk for which there is a Hadamard matrix of order k22+[ϵlog2k]k2^{2+[\epsilon\log_2k]} has positive density in the set of natural numbers. The proof adapts a number-theoretic argument of Erdos and Odlyzko to show that there are enough Paley Hadamard matrices to give the result.

Keywords

Cite

@article{arxiv.1003.4001,
  title  = {On the Asymptotic Existence of Hadamard Matrices},
  author = {Warwick de Launey},
  journal= {arXiv preprint arXiv:1003.4001},
  year   = {2010}
}

Comments

Keywords: Hadamard matrices, Asymptotic existence, Cocyclic Hadamard matrices, Relative difference sets, Riesel numbers, Extended Riemann hypothesis. (Received 2 August 2008, Available online 18 March 2009)