English

The Gale-Berlekamp game for complex Hadamard matrices

Combinatorics 2014-12-03 v5 Probability

Abstract

Associated to a complex Hadamard matrix HMN(C)H\in M_N(\mathbb C) is the complex probability measure μP(C)\mu\in\mathcal P(\mathbb C) describing the distribution of φ(a,b)=<a,Hb>\varphi(a,b)=<a,Hb>, where a,bTNa,b\in\mathbb T^N are random. This measure is called "glow" of the matrix, due to the analogy with the Gale-Berlekamp switching game, where H,a,bH,a,b are real. We prove here that: (1) μ\mu becomes complex Gaussian in the NN\to\infty limit, (2) the universality holds as well at order 2, (3) the order 3 term seems to be quite interesting, particularly for the master Hadamard matrices, (4) in the Fourier matrix case, some of the higher order terms control counting problems for circulant Hadamard matrices.

Cite

@article{arxiv.1310.1810,
  title  = {The Gale-Berlekamp game for complex Hadamard matrices},
  author = {Teodor Banica},
  journal= {arXiv preprint arXiv:1310.1810},
  year   = {2014}
}

Comments

Withdrawn by the author - the main findings in this paper are now part of arXiv:1403.2108

R2 v1 2026-06-22T01:41:45.621Z