Gröbner bases and cocyclic Hadamard matrices

From MaRDI portal
Publication:1635271

DOI10.1016/J.JSC.2017.09.001zbMATH Open1396.13024arXiv1603.01859OpenAlexW2294836888MaRDI QIDQ1635271FDOQ1635271


Authors: José Andrés Armario, Raúl M. Falcón, María Dolores Frau, Félix Gudiel, Victor Alvarez Edit this on Wikidata


Publication date: 6 June 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable us to describe a polynomial ideal that characterizes the set of cocyclic Hadamard matrices over a fixed finite group G of order 4t. Nevertheless, the complexity of the computation of the reduced Gr"obner basis of this ideal is 2O(t2), which is excessive even for very small orders. In order to improve the efficiency of this polynomial method, we take advantage of some recent results on the inner structure of a cocyclic matrix to describe an alternative polynomial ideal that also characterizes the mentioned set of cocyclic Hadamard matrices over G. The complexity of the computation decreases in this way to 2O(n), where n is the number of G-coboundaries. Particularly, we design two specific procedures for looking for mathbbZtimesmathbbZ22-cocyclic Hadamard matrices and D4t-cocyclic Hadamard matrices, so that larger cocyclic Hadamard matrices (up to tleq31) are explicitly obtained.


Full work available at URL: https://arxiv.org/abs/1603.01859




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: Gröbner bases and cocyclic Hadamard matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1635271)