Gröbner bases and cocyclic Hadamard matrices
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are uniquely related toHadamard matrices with one or two circulant cores of a given or-der. Based on this idea, the cocyclic Hadamard test enables us todescribe a polynomial ideal that characterizes the s...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2018 |
| 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/89718 |
| Acceso en línea: | https://hdl.handle.net/11441/89718 https://doi.org/10.1016/j.jsc.2017.09.001 |
| Access Level: | acceso abierto |
| Palabra clave: | Hadamard matrices Basis of cocycles Polynomial ring |
| Sumario: | Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are uniquely related toHadamard matrices with one or two circulant cores of a given or-der. Based on this idea, the cocyclic Hadamard test enables us todescribe a polynomial ideal that characterizes the set of cocyclicHadamard matrices over a fixed finite group Gof order 4t. Nev-ertheless, the complexity of the computation of the reduced Gröb-ner basis of this ideal is 2O(t2), which is excessive even for very small orders. In order to improve the efficiency of this polynomialmethod, we take advantage of some recent results on the innerstructure of a cocyclic matrix to describe an alternative polyno-mial ideal that also characterizes the aforementioned set of cocyclicHadamard matrices over G. The complexity of the computation de-creases in this way to 2O(t). Particularly, we design two specific procedures for looking for Zt×Z22-cocyclic Hadamard matrices and D4t-cocyclic Hadamard matrices, so that larger cocyclic Hadamard matrices (up to t≤39) are explicitly obtained. |
|---|