A genetic algorithm for cocyclic hadamard matrices

A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, the algorithm may be easily extended to cover any group. Some executions and examples are also included, with aid of Mathematica 4.0

A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices

A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. The novelty of this algorithm is the guided heuristic procedure for reproduction, instead of the classical crossover and mutation operators. We include some runs of the algorithm for dihedral groups, which are known to give rise to a large amount of cocyclic Hadamard matrices.Ministerio de Ciencia e Innovación MTM2008-06578Junta de Andalucía FQM–296Junta de Andalucía P07-FQM-0298

The homological reduction method for computing cocyclic Hadamard matrices

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

An algorithm for computing cocyclic matrices developed over some semidirect products

An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups is constructed, in light ofthe theory over cocyclic matrices developed by Horadam and de Launey in [7],[8]. The method involves some homological perturbation techniques [3],[1], in the homological correspondent to the work which Grabmeier and Lambe described in [12] from the viewpoint ofcohomology . Examples ofexplicit computations over all dihedral groups D 4t are given, with aid of Mathematica

On higher dimensional cocyclic Hadamard matrices

Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, from which the whole set of n-dimensional n-cocyclic matrices over G may be straightforwardly calculated. Focusing in the case n=2 (which is of special interest, e.g. for looking for cocyclic Hadamard matrices), this method provides a basis for 2-cocycles in such a way that representative 2-cocycles are calculated all at once, so that there is no need to distinguish between inflation and transgression 2-cocycles (as it has traditionally been the case until now). When n>2, this method provides an uniform way of looking for higher dimensional n-cocyclic Hadamard matrices for the first time. We illustrate the method with some examples, for n=2,3. In particular, we give some examples of improper 3-dimensional 3-cocyclic Hadamard matrices

The cohomological reduction method for computing n-dimensional cocyclic matrices

Provided that a cohomological model for $G$ is known, we describe a method for constructing a basis for $n$-cocycles over $G$, from which the whole set of $n$-dimensional $n$-cocyclic matrices over $G$ may be straightforwardly calculated. Focusing in the case $n=2$ (which is of special interest, e.g. for looking for cocyclic Hadamard matrices), this method provides a basis for 2-cocycles in such a way that representative $2$-cocycles are calculated all at once, so that there is no need to distinguish between inflation and transgression 2-cocycles (as it has traditionally been the case until now). When $n>2$, this method provides an uniform way of looking for higher dimensional $n$-cocyclic Hadamard matrices for the first time. We illustrate the method with some examples, for $n=2,3$. In particular, we give some examples of improper 3-dimensional $3$-cocyclic Hadamard matrices.Comment: 17 pages, 0 figure

Homological models for semidirect products of finitely generated Abelian groups

Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit contraction (special homotopy equivalence) from the reduced bar construction of the group ring of G, B¯¯¯¯(ZZ[G]) , to a much smaller DGA-module hG. Such a contraction is called a homological model for G and is used as the input datum in the methods described in Álvarez et al. (J Symb Comput 44:558–570, 2009; 2012) for calculating a generating set for representative 2-cocycles and n-cocycles over G, respectively. These computations have led to the finding of new cocyclic Hadamard matrices (Álvarez et al. in 2006)

Quanta of Maths

The work of Alain Connes has cut a wide swath across several areas of math- ematics and physics. Reflecting its broad spectrum and profound impact on the contemporary mathematical landscape, this collection of articles covers a wealth of topics at the forefront of research in operator algebras, analysis, noncommutative geometry, topology, number theory and physics