Hadamard Matrices Of Williamson Type: A Challenge For Computer Algebra

摘要

We describe new families of challenging polynomial systems of equations arising in the construction of Hadamard matrices of Williamson type. These systems depend on a parameter and exhibit a number of symmetries. We demonstrate that Genetic Algorithms form a suitable tool to apply to these systems, for which the traditional Computer Algebra methods seem to be inappropriate.