Regular Hadamard matrix

From Wikipedia, the free encyclopedia

In mathematics a regular Hadamard matrix is a Hadamard matrix whose row and column sums are all equal. While the order of a Hadamard matrix must be 1, 2, or a multiple of 4, regular Hadamard matrices carry the further restriction that the order be a perfect square. The excess, denoted E(H), of a Hadamard matrix H of order n is defined to be the sum of the entries of H. The excess satisfies the bound |E(H)|≤n3/2. A Hadamard matrix attains this bound if and only if it is regular.

If n=4u2 is the order of a regular Hadamard matrix, then the excess is \pm 8u^3 and the row and column sums all equal \pm 2u. It follows that each row has 2u^2\pm u positive entries and 2u^2\mp u negative entries. The orthogonality of rows implies that any two distinct rows have exactly u^2\pm u positive entries in common. If H is interpreted as the incidence matrix of a block design, with 1 representing incidence and -1 representing non-incidence, then H corresponds to a 2-(v,k,λ) design with parameters (4u^2,2u^2\pm u,u^2 \pm u). A design with these parameters is called a Menon design.

A number of methods for constructing regular Hadamard matrices are known, and some exhaustive computer searches have been done for regular Hadamard matrices with specified symmetry groups, but it is not known whether every even perfect square is the order of a regular Hadamard matrix. Bush-type Hadamard matrices are regular Hadamard matrices of a special form, and are connected with finite projective planes.

[edit] References

  • C.J. Colbourn and J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, 2nd ed., CRC Press, Boca Raton, FL., 2006.
  • W. D. Wallis, Anne Penfold Street, and Jennifer Seberry Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Springer-Verlag, Berlin 1972.
This combinatorics-related article is a stub. You can help Wikipedia by expanding it.