Calculating cocyclic hadamard matrices in Mathematica: exhaustive and heuristic searches
We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = 4t, performs an exhaustive search for constructing the whole set of cocyclic Hadamard matrices over G. Since such an exhaustive search is not practical for orders 4t ≥28, the pro...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2006 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/31610 |
| Acceso en línea: | http://hdl.handle.net/11441/31610 https://doi.org/10.1007/11832225_42 |
| Access Level: | acceso abierto |
| Palabra clave: | Numeric Computing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Algorithm Analysis and Problem Complexity Mathematical Software Algorithms |
| Sumario: | We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = 4t, performs an exhaustive search for constructing the whole set of cocyclic Hadamard matrices over G. Since such an exhaustive search is not practical for orders 4t ≥28, the program also provides an alternate method, in which an heuristic search (in terms of a genetic algorithm) is performed. We include some executions and examples |
|---|