A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion of fitness, and a peculiar local search, defined as a constraint satisfaction problem. Calculations support the idea that finding a cocyclic Hadamard matrix of order 4 · 47 might be within reach, for the first time, progressing further upon the ideas explained in this work.Junta de Andalucía FQM-01
AbstractLet q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq...
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph ...
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is describe...
A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. Th...
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s...
We describe a notebook in Mathematica which, taking as input data a homological model for a finite g...
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are ...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not t...
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yi...
A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyc...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices s...
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is descr...
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” m...
AbstractLet q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq...
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph ...
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is describe...
A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. Th...
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s...
We describe a notebook in Mathematica which, taking as input data a homological model for a finite g...
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are ...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not t...
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yi...
A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyc...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices s...
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is descr...
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” m...
AbstractLet q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq...
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph ...
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is describe...