A construction for Hadamard matrices

Let 2ⁿm be the order of an Hadamard matrix. Using block Golay sequences, a class of Hadamard matrices of order (r+4ⁿ+1)4ⁿ⁺¹m² is constructed, where r is the length of a Golay sequence.     

A construction for modified generalized Hadamard matrices using QGH matrices

Let G be a group of order mu and U a normal subgroup of G of order u. Let G/U = {U ₁,U ₂, . . . ,U _m } be the set of cosets of U in G. We say a matrix H = [h _ij ] of order k with entries from G is a quasi-generalized Hadamard matrix with respect to the cosets G/U if \({\sum_{1\le t \le k} h_{it}h_{jt}^{-1} = \lambda_{ij1}U_1+\cdots+\lambda_{ijm}U_m (\exists\lambda_{ij1},\ldots, \exists \lambda_{ijm} \in \mathbb{Z})}\) for any i ≠ j. On the other hand, in our previous article we defined a modified generalized Hadamard matrix GH(s, u, λ) over a group G, from which a TD _λ (uλ, u) admitting G as a semiregular automorphism group is obtained. In this article, we present a method for combining quasi-generalized Hadamard matrices and semiregular relative difference sets to produce modified generalized Hadamard matrices.     

New restrictions on possible orders of circulant Hadamard matrices

We obtain several new number theoretic results which improve the field descent method. We use these results to rule out many of the known open cases of the circulant Hadamard matrix conjecture. In particular, the only known open case of the Barker sequence conjecture is settled.     

On a series of Hadamard matrices of order 2 t and the maximal excess of Hadamard matrices of order 22t

In this paper we give a new series of Hadamard matrices of order 2 ^t . When the order is 16, Hadamard matrices obtained here belong to class II, class V or to class IV of Hall's classification [3]. By combining our matrices with the matrices belonging to class I, class II or class III obtained before, we can say that we have direct construction, namely without resorting to block designs, for all classes of Hadamard matrices of order 16.Furthermore we show that the maximal excess of Hadamard matrices of order 2^2t is 2^3t , which was proved by J. Hammer, R. Levingston and J. Seberry [4]. We believe that our matrices are inequivalent to the matrices used by the above authors. More generally, if there is an Hadamard matrix of order 4n ² with the maximal excess 8n ³, then there exist more than one inequivalent Hadamard matrices of order 2^2t n ² with the maximal excess 2^3t n ³ for anyt 2.     

A new construction for Williamson-type matrices

It is shown that ifq is a prime power then there are Williamson-type matrices of order

1. 1/2q ²(q + 1) whenq ≡ 1 (mod 4).
2. 1/4q ²(q + 1) whenq ≡ 3 (mod 4) and there are Williamson-type matrices of order 1/4(q + 1).

This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4 ? 8349.     

New Hadamard matrices and conference matrices obtained via Mathon's construction

We give a formulation, via (1, –1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 59^2t+1 + 1,t 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 69^2t+1 + 2, 109^2t+1 + 2, 8499 ^t ,t 0;q ²(q + 3) + 2 whereq 3 (mod 4) is a prime power and 1/2(q + 5) is the order of a skew-Hadamard matrix); (q + 1)q ²9 ^t ,t 0 (whereq 7 (mod 8) is a prime power and 1/2(q + 1) is the order of an Hadamard matrix). We also give new constructions for Hadamard matrices of order 49 ^t 0 and (q + 1)q ² (whereq 3 (mod 4) is a prime power).This work was supported by grants from ARGS and ACRB.Dedicated to the memory of our esteemed friend Ernst Straus.     

Hadamard matrices of order 4(2p + 1)

It is shown in this paper that if p is a prime and q = 2p ? 1 is a prime power, then there exists an Hadamard matrix of order 4(2p + 1).     

The quaternary complex Hadamard matrices of orders 10, 12, and 14

A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the one hand, it is proven that all 10×10 and 12×12 quaternary complex Hadamard matrices belong to some parametric family, but on the other hand, it is shown by exhibiting an isolated 14×14 matrix that there cannot be a general method for introducing parameters into these types of matrices.     

Deciding Hadamard equivalence of Hadamard matrices

Equivalence of Hadamard matrices can be decided inO(log² n) space, and hence in subexponential time. These resource bounds follow from the existence of small distinguishing sets.     

Constructing cocyclic Hadamard matrices of order 4p

Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices (HMs) with interesting algebraic properties. Ó Catháin and Röder described a classification algorithm for CHMs of order $4n$ based on relative difference sets in groups of order $8n$; this led to the classification of all CHMs of order at most 36. On the basis of work of de Launey and Flannery, we describe a classification algorithm for CHMs of order $4p$ with $p$ a prime; we prove refined structure results and provide a classification for $p\le 13$. Our analysis shows that every CHM of order $4p$ with $p\equiv 1mod4$ is equivalent to a HM with one of five distinct block structures, including Williamson‐type and (transposed) Ito matrices. If $p\equiv 3mod4$, then every CHM of order $4p$ is equivalent to a Williamson‐type or (transposed) Ito matrix.     

Skew‐Hadamard matrices of orders 436, 580, and 988 exist

We construct two difference families on each of the cyclic groups of order 109, 145, and 247, and use them to construct skew‐Hadamard matrices of orders 436, 580, and 988. Such difference families and matrices are constructed here for the first time. The matrices are constructed by using the Goethals‐Seidel array. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 493–498, 2008     

A system of equations for describing cocyclic Hadamard matrices

Given a basis for 2‐cocycles over a group G of order , we describe a nonlinear system of 4t‐1 equations and k indeterminates over , whose solutions determine the whole set of cocyclic Hadamard matrices over G, in the sense that ( ) is a solution of the system if and only if the 2‐cocycle gives rise to a cocyclic Hadamard matrix . Furthermore, the study of any isolated equation of the system provides upper and lower bounds on the number of coboundary generators in which have to be combined to form a cocyclic Hadamard matrix coming from a special class of cocycles. We include some results on the families of groups and . A deeper study of the system provides some more nice properties. For instance, in the case of dihedral groups , we have found that it suffices to check t instead of the 4t rows of , to decide the Hadamard character of the matrix (for a special class of cocycles f). © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 276–290, 2008     

On a new class of productive regular Hadamard matrices

We show that for each integer n for which there is a Hadamard matrix of order 4n and 8n²-1 is a prime number, there is a productive regular Hadamard matrix of order 16n²(8n²-1)². As a corollary, by applying a recent result of Ionin, we get many parametrically new classes of symmetric designs whenever either of 4n(8n²-1)-1 or 4n(8n²-1)+1 is a prime power.     

Decomposition of Hadamard matrices

The decomposition is defined. The components are each as an orthogonal matrix with elements 0, ±1. In pairs they satisfy XY^T + YX^T = 0. It is conjectured that every Hadamard matrix of order mn is decomposable into m components for m = 4 or 8.     

Hadamard products of matrices

The entry-wise product of arbitrary n × ncomplex matrices is studied. The principal tools used include the Kionecker product, field of values and diagonal multiplications. Inclusion theorems for the field of values and spectrum are developed in the general case and refined in special cases. These are employed to obtain inequalities involving the real parts of the characteristic roots and the numerical radius, and previously known results are found to be special cases of several of the theorems. In addition, the case of positive stable matrices is considered and a new class of nonnegative stable matrices is introduced, studied and related to D-stability.     

Ryser's embedding problem for Hadamard matrices

What is the minimum order of a Hadamard matrix that contains an a by b submatrix of all 1's? Newman showed that where c^? denotes the smallest order greater than or equal to c for which a Hadamard matrix exists. It follows that if 4 divides both a and b, and if the Hadamard conjecture is true, then . We establish the improved bounds for min {a,b} ≥ 2. The Hadamard conjecture therefore implies that if 4 divides both 2ab and ?a/2? ?b/2?, then (a, b) = 2 · max {?a/2?b, ?b/2?a}. Our lower bound comes from a counting argument, while our upper bound follows from a sub‐multiplicative property of : Improvements in our upper bound occur when suitable conference matrices or Bush‐type Hadamard matrices exist. We conjecture that any (1,?1)‐matrix of size a by b occurs as a submatrix of some Hadamard matrix of order at most . © 2005 Wiley Periodicals, Inc. J Combin Designs     

Equivalence of Hadamard matrices

Supposem is a square-free odd integer, andA andB are any two Hadamard matrices of order 4m. We will show thatA andB are equivalent over the integers (that is,B can be obtained fromA using elementary row and column operations which involve only integers).     

A sensitive algorithm for detecting the inequivalence of Hadamard matrices

A Hadamard matrix of side is an matrix with every entry either or , which satisfies . Two Hadamard matrices are called equivalent if one can be obtained from the other by some sequence of row and column permutations and negations. To identify the equivalence of two Hadamard matrices by a complete search is known to be an NP hard problem when increases. In this paper, a new algorithm for detecting inequivalence of two Hadamard matrices is proposed, which is more sensitive than those known in the literature and which has a close relation with several measures of uniformity. As an application, we apply the new algorithm to verify the inequivalence of the known inequivalent Hadamard matrices of order ; furthermore, we show that there are at least pairwise inequivalent Hadamard matrices of order . The latter is a new discovery.