Table of Contents
Fetching ...

Invitation to Hadamard matrices

Teo Banica

Abstract

An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit circle, $|H_{ij}|=1$, and whose rows and pairwise orthogonal. The main examples are the Fourier matrices, $F_N=(w^{ij})$ with $w=e^{2πi/N}$, and at the level of the general theory, the complex Hadamard matrices can be thought of as being some sort of exotic, generalized Fourier matrices. We discuss here the basic theory of the Hadamard matrices, real and complex, with emphasis on the complex matrices, and their geometric and analytic aspects.

Invitation to Hadamard matrices

Abstract

An Hadamard matrix is a square matrix whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices whose entries are on the unit circle, , and whose rows and pairwise orthogonal. The main examples are the Fourier matrices, with , and at the level of the general theory, the complex Hadamard matrices can be thought of as being some sort of exotic, generalized Fourier matrices. We discuss here the basic theory of the Hadamard matrices, real and complex, with emphasis on the complex matrices, and their geometric and analytic aspects.

Paper Structure

This paper contains 20 sections, 350 theorems, 1867 equations.

Key Result

Proposition 1.2

A binary matrix $H\in M_N(\pm1)$ is Hadamard when its rows have the property that, when comparing any two of them, the number of matchings $(e_i=f_i)$ equals the number of mismatchings $(e_i\neq f_i)$.

Theorems & Definitions (789)

  • Definition 1.1
  • Proposition 1.2
  • proof
  • Proposition 1.3
  • proof
  • Theorem 1.4
  • proof
  • Theorem 1.5
  • proof
  • Theorem 1.6
  • ...and 779 more