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.     

Properties of submatrices of Sylvester Hadamard matrices

We investigate the algebraic behaviour of leading principal submatrices of Hadamard matrices being powers of 2. We provide analytically the spectrum of general submatrices of these Hadamard matrices. Symmetry properties and relationships between the upper left and lower right corners of the matrices in this respect are demonstrated. Considering the specific construction scheme of this particular class of Hadamard matrices (called Sylvester Hadamard matrices), we utilize tensor operations to prove the respective results. An algorithmic procedure yielding the complete spectrum of leading principal submatrices of Sylvester Hadamard matrices is proposed.     

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.

     

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.     

A spectral equivalence for Jacobi matrices

We use the classical results of Baxter and Golinskii–Ibragimov to prove a new spectral equivalence for Jacobi matrices on . In particular, we consider the class of Jacobi matrices with conditionally summable parameter sequences and find necessary and sufficient conditions on the spectral measure such that and lie in or for s1.     

A note on the Hadamard product of matrices

It is shown that the smallest eigenvalue of the Hadamard product A × B of two positive definite Hermitian matrices is bounded from below by the smallest eigenvalue of AB^T.     

An application of Sylvester matrices

In a Banach lattice, the convergence of a series of absolute values $ \sum\limits_{{k\geq 1}} {\left| {{x_k}} \right|} $ implies the unconditional convergence of the series $ \sum\limits_{{k\geq 1}} {{x_k}} $ . The converse assertion is valid only in Banach lattices order-isomorphic to M-spaces. In this paper a new proof of this fact using Sylvester series is given.     

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     

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     

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.     

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.     

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).     

On the existence of Hadamard matrices

Given any natural number q > 3 we show there exists an integer t ? [2log₂(q ? 3)] such that an Hadamard matrix exists for every order 2^sq where s > t. The Hadamard conjecture is that s = 2.This means that for each q there is a finite number of orders 2^υq for which an Hadamard matrix is not known. This is the first time such a statement could be made for arbitrary q.In particular it is already known that an Hadamard matrix exists for each 2^sq where if q = 2^m ? 1 then s ? m, if q = 2^m + 3 (a prime power) then s ? m, if q = 2^m + 1 (a prime power) then s ? m + 1.It is also shown that all orthogonal designs of types (a, b, m ? a ? b) and (a, b), 0 ? a + b ? m, exist in orders m = 2^t and 2^t+2 · 3, t ? 1 a positive integer.     

M-矩阵Hadamard积的新不等式(英文)

设A和B是非奇异M-矩阵,给出了关于A和B-1的Hadamard积的最小特征值下界τ(A°B-1)的一个新估计式,该结果改进了文献[4]的结果.     

Equivalence of Butson-type Hadamard matrices

Journal of Algebraic Combinatorics - Two matrices $$H_1$$ and $$H_2$$ with entries from a multiplicative group G are said to be monomially equivalent, denoted by $$H_1cong H_2$$ , if one of the...     

The weights of Hadamard matrices

Let $\text{Ω}{}_{\mathrm{n}}$ denote the set of all n × n Hadamard matrices. For $\text{H ∈ Ω}{}_{\mathrm{n}}$, define the weight of H to be w(H) = number of 1's in H, and $\text{w(n) =}\text{max}\text{{w(H); H ∈ Ω}{}_{\mathrm{n}}\text{}}$. In this paper, we derive upper and lower bounds for w(n).