The homological reduction method for computing cocyclic Hadamard matrices

Abstract

An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a homological model View the MathML sourceB̄(Z[G])ϕ:⇌HFhG for GG is known, the homological reduction method automatically generates a full basis for 2-cocycles over GG (including 2-coboundaries). From these data, either an exhaustive or a heuristic search for Hadamard cocyclic matrices is then developed. The knowledge of an explicit basis for 2-cocycles which includes 2-coboundaries is a key point for the designing of the heuristic search. It is worth noting that some Hadamard cocyclic matrices have been obtained over groups GG for which the exhaustive searching techniques are not feasible. From the computational-cost point of view, even in the case that the calculation of such a homological model is also included, comparison with other methods in the literature shows that the homological reduction method drastically reduces the required computing time of the operations involved, so that even exhaustive searches succeeded at orders for which previous calculations could not be completed. With aid of an implementation of the method in Mathematica, some examples are discussed, including the case of very well-known groups (finite abelian groups, dihedral groups) for clarity.