Symmetric Weighing Matrices Constructed using Group Matrices

A weighing matrix of order n and weight m² is a square matrix M of order n with entries from {-1,0,+1} such that MM^T=m²I where I is the identity matrix of order n. If M is a group matrix constructed using a group of order n, M is called a group weighing matrix. Recently, group weighing matrices were studied intensively, especially when the groups are cyclic and abelian. In this paper, we study the abelian group weighing matrices that are symmetric, i.e.M^T=M. Some new examples are found. Also we obtain a few exponent bounds on abelian groups that admit symmetric group weighing matrices. In particular, we prove that there is no symmetric abelian group weighing matrices of order 2p^r and weight p² where p is a prime and p≥ 5.Communicated by: K.T. Arasu     

Williamson matrices up to order 59

A recent result of Schmidt has brought Williamson matrices back into the spotlight. In this article, a new algorithm is introduced to search for hard to find Williamson matrices. We find all nonequivalent Williamson matrices of odd order n up to n = 59. It turns out that there are none for n = 35, 47, 53, 59 and it seems that the Turyn class may be the only infinite class of these matrices.      

Hadamard Matrices and Dihedral Groups

Let D _2p be a dihedral group of order 2p, where p is an odd integer. Let ZD _2p be the group ring of D _2p over the ring Z of integers. We identify elements of ZD _2p and their matrices of the regular representation of ZD _2p . Recently we characterized the Hadamard matrices of order 28 ([6] and [7]). There are exactly 487 Hadamard matrices of order 28, up to equivalence. In these matrices there exist matrices with some interesting properties. That is, these are constructed by elements of ZD ₆. We discuss relation of ZD _2p and Hadamard matrices of order n=8p+4, and give some examples of Hadamard matrices constructed by dihedral groups.     

A weak difference set construction for higher dimensional designs

We continue the analysis of de Launey's modification of development of designs modulo a finite groupH by the action of an abelian extension function (AEF), and of the proper higher dimensional designs which result.We extend the characterization of allAEFs from the cyclic group case to the case whereH is an arbitrary finite abelian group.We prove that ourn-dimensional designs have the form (f(j ₁ j ₂ ...j _n )) (j _i J), whereJ is a subset of cardinality |H| of an extension groupE ofH. We say these designs have a weak difference set construction.We show that two well-known constructions for orthogonal designs fit this development scheme and hence exhibit families of such Hadamard matrices, weighing matrices and orthogonal designs of orderv for which |E|=2v. In particular, we construct proper higher dimensional Hadamard matrices for all orders 4t100, and conference matrices of orderq+1 whereq is an odd prime power. We conjecture that such Hadamard matrices exist for all ordersv0 mod 4.     

On the invertlbility of hadamard powers of distance matrices

We determine the invertibilty or singularity, as appropriate, for all (positive) integral Hadamard powers of distance matrices.     

A limit theorem for the eigenvalues of product of two random matrices

The existence of limit spectral distribution of the product of two independent random matrices is proved when the number of variables tends to infinity. One of the above matrices is the Wishart matrix and the other is a symmetric nonnegative definite matrix.     

An algorithm to find formulae and values of minors for Hadamard matrices

We give an algorithm to obtain formulae and values for minors of Hadamard matrices. One step in our algorithm allows the (n−j)×(n−j) minors of a Hadamard matrix to be given in terms of the minors of a 2^j−1×2^j−1 matrix. In particular we illustrate our algorithm by finding explicitly all the (n−4)×(n−4) minors of a Hadamard matrix.     

Skew-Hadamard Matrices and the Smith Normal Form

We show that the Smith normal form of every skew-Hadamard matrix of order 4m is diag[1,2,...,2, 2m,...,2m,4m]     

The Hankel pencil conjecture

The Toeplitz pencil conjecture stated in [W. Schmale, P.K. Sharma, Problem 30-3: singularity of a toeplitz matrix, IMAGE 30 (2003); W. Schmale, P.K. Sharma, Cyclizable matrix pairs over and a conjecture on toeplitz pencils, Linear Algebra Appl. 389 (2004) 33-42] is equivalent to a conjecture for n×n Hankel pencils of the form H_n(x)=(c_i+j-n+1), where c₀=x is an indeterminate, c_l=0 for l<0, and for l1. In this paper it is shown to be implied by another conjecture, which we call the root conjecture. The root conjecture asserts a strong relationship between the roots of certain submaximal minors of H_n(x) specialized to have c₁=c₂=1. We give explicit formulae in the c_i for these minors and prove the root conjecture for minors m_nn,m_n-1,n of degree 6. This implies the Hankel Pencil conjecture for matrices up to size 8×8. The main tools involved are a partial parametrization of the set of solutions of systems of polynomial equations that are both homogeneous and index sum homogeneous, and use of the Sylvester identity for matrices.