Gröbner bases and cocyclic Hadamard matrices

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

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

4 t

. Nevertheless, the complexity of the computation of the reduced Gr"obner basis of this ideal is

2^{O (t^{2})}

, 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

2^{O (n)}

, where

n

is the number of

G

-coboundaries. Particularly, we design two specific procedures for looking for

m a t h b b Z_{t} i m e s m a t h b b Z_{2}^{2}

-cocyclic Hadamard matrices and

D_{4 t}

-cocyclic Hadamard matrices, so that larger cocyclic Hadamard matrices (up to

t l e q 31

) are explicitly obtained.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

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)