The Gale-Berlekamp game for Hadamard matrices

Abstract

Given an Hadamard matrix H∈ MN(1) we consider the function : Z2N× Z2N Z given by (a,b)=ΣijaibjHij, which sums the entries of the various conjugates of H, obtained by switching signs on rows and columns. Our claim is that , or just its probabilistic distribution μ∈ P( Z), that we call "glow" of the matrix, should encode important information about H. We present here a number of results and conjectures in this direction, notably with a general decomposition result for μ.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…