Power Hadamard matrices

We introduce power Hadamard matrices, in order to study the structure of (group) generalized Hadamard matrices, Butson (generalized) Hadamard matrices and other related orthogonal matrices, with which they share certain common characteristics. The new objects turn out to be as interesting, and perhaps as useful, as the objects that motivated them.We develop a basic theory of power Hadamard matrices, explore these relationships, and offer some new insights into old results. For example, we show that all 4×4 Butson Hadamard matrices are equivalent to circulant ones, and how to move between equivalence classes.We provide, among other new things, an infinite family of circulant Butson Hadamard matrices that extends a known class to include one of each positive integer order.Dedication: In 1974 Jennifer Seberry (Wallis) introduced what was then a totally new structure, orthogonal designs, in order to study the existence and construction of Hadamard matrices. They have proved their worth for this purpose, and have also become an object of interest for their own sake and in applications (e.g., [H.J.V. Tarok, A.R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inf. Theory 45 (1999) 1456-1467. [26]]). Since then many other generalizations of Hadamard matrices have been introduced, including some discussed herein. In the same spirit we introduce a new object showing this kind of promise.Seberry's contributions to this field are not limited to her own work, of which orthogonal designs are but one example—she has mentored many young mathematicians who have expanded her legacy by making their own marks in this field. It is fitting, therefore, that our contribution to this volume is a collaboration between one who has worked in this field for over a decade and an undergraduate student who had just completed his third year of study at the time of the work.     

Orbit matrices of Hadamard matrices and related codes

In this paper we introduce the notion of orbit matrices of Hadamard matrices with respect to their permutation automorphism groups and show that under certain conditions these orbit matrices yield self-orthogonal codes. As a case study, we construct codes from orbit matrices of some Paley type I and Paley type II Hadamard matrices. In addition, we construct four new symmetric (100,45,20) designs which correspond to regular Hadamard matrices, and construct codes from their orbit matrices. The codes constructed include optimal, near-optimal self-orthogonal and self-dual codes, over finite fields and over ${\mathbb{Z}}_4$.     

Regular Hadamard matrices constructed from Hadamard 2-designs and conference graphs

Suppose there exists a Hadamard 2-$(m,\frac{m?1}{2},\frac{m?3}{4})$ design having skew incidence matrix. If there exists a conference graph on $2m?1$ vertices, then there exists a regular Hadamard matrix of order $4m^2$. A conference graph on $2m+3$ vertices yields a regular Hadamard matrix of order $4{(m+1)}^2$.     

Balancedly splittable Hadamard matrices

Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are presented. As an application, commutative association schemes of 4, 5, and 6 classes are constructed.     

Mappings of Butson-type Hadamard matrices

A $\mathrm{BH}(q,n)$ Butson-type Hadamard matrix $H$ is an $n\times n$ matrix over the complex $q$th roots of unity that fulfils $H{H}^1=n{I}_n$. It is well known that a $\mathrm{BH}(4,n)$ matrix can be used to construct a $\mathrm{BH}(2,2n)$ matrix, that is, a real Hadamard matrix. This method is here generalised to construct a $\mathrm{BH}(q,pn)$ matrix from a $\mathrm{BH}(pq,n)$ matrix, where $q$ has at most two distinct prime divisors, one of them being $p$. Moreover, an algorithm for finding the domain of the mapping from its codomain in the case $p=q=2$ is developed and used to classify the $\mathrm{BH}(4,16)$ matrices from a classification of the $\mathrm{BH}(2,32)$ matrices.     

Cocyclic Hadamard matrices from forms over finite Frobenius rings

We give a construction of cocyclic Butson-Hadamard matrices from bilinear forms over finite Frobenius rings, which generalizes previous constructions. We then prove a classification result, showing that the resulting matrices depend only on the additive group of the underlying module of the form.     

Classification of Hadamard matrices of order 44 with automorphisms of order 7

The Hadamard matrices of order 44 possessing automorphisms of order 7 are classified. The number of their equivalence classes is 384. The order of their full automorphism group is calculated. These Hadamard matrices yield 1683 nonisomorphic 3-(44,22,10) designs, 57932 nonisomorphic 2-(43,21,10) designs, and two inequivalent extremal binary self-dual doubly even codes of length 88 (one of them being new).     

两个Hermitian矩阵的Hadamard乘积的特征值估计

Schur定理规定了半正定矩阵的Hadamard乘积的所有特征值的整体界限,Eric Iksoon lm在同样的条件下确定了每个特征值的特殊的界限,本文给出了Hermitian矩阵的Hadamard乘积的每个特征值的估计,改进和推广了I.Schur和Eric Iksoon Im的相应结果。     

Homomorphisms of matrix algebras and constructions of Butson–Hadamard matrices

An $n\times n$ matrix $H$ is Butson–Hadamard if its entries are $k$th roots of unity and it satisfies $H{H}^1=n{I}_n$. Write $\mathrm{BH}(n,k)$ for the set of such matrices.Suppose that $k=p^{\alpha }{q}^{\beta }$ where $p$ and $q$ are primes and $\alpha \ge 1$. A recent result of Östergård and Paavola uses a matrix $H\in \mathrm{BH}(n,pk)$ to construct $H^{\prime }\in \mathrm{BH}(pn,k)$. We simplify the proof of this result and remove the restriction on the number of prime divisors of $k$. More precisely, we prove that if $k=mt$, and each prime divisor of $k$ divides $t$, then we can construct a matrix $H^{\prime }\in \mathrm{BH}(mn,t)$ from any $H\in \mathrm{BH}(n,k)$.     

2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order,and their related Hadamard matrices and codes

We present the full classification of Hadamard 2-(31,15,7), Hadamard 2-(35, 17,8) and Menon 2-(36,15,6) designs with automorphisms of odd prime order. We also give partial classifications of such designs with automorphisms of order 2. These classifications lead to related Hadamard matrices and self-dual codes. We found 76166 Hadamard matrices of order 32 and 38332 Hadamard matrices of order 36, arising from the classified designs. Remarkably, all constructed Hadamard matrices of order 36 are Hadamard equivalent to a regular Hadamard matrix. From our constructed designs, we obtained 37352 doubly-even [72,36,12] codes, which are the best known self-dual codes of this length until now.      

On the asymptotic existence of Hadamard matrices

It is conjectured that Hadamard matrices exist for all orders 4t (t>0). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural numbers k, there is a Hadamard matrix of order k²[a+blog₂k], where a and b are fixed non-negative constants. To prove the Hadamard Conjecture, it is sufficient to show that we may take a=2 and b=0. Since Seberry's ground-breaking result, which showed that we may take a=0 and b=2, there have been several improvements where b has been by stages reduced to 3/8. In this paper, we show that for all ?>0, the set of odd numbers k for which there is a Hadamard matrix of order k²2+[?log₂k] has positive density in the set of natural numbers. The proof adapts a number-theoretic argument of Erdos and Odlyzko to show that there are enough Paley Hadamard matrices to give the result.     

The Hadamard Product of Circulant Matrices on Three Symbols that are Inverses of M-Matrices

It is shown that the class of all n × n inverse M-matrices A for which both A and A -1 are circulant matrices on three symbols is closed under Hadamard products.     

Graph switching, 2-ranks,and graphical Hadamard matrices

We study the behavior of the 2-rank of the adjacency matrix of a graph under Seidel and Godsil–McKay switching, and apply the result to graphs coming from graphical Hadamard matrices of order $4^m$. Starting with graphs from known Hadamard matrices of order 64, we find (by computer) many Godsil–McKay switching sets that increase the 2-rank. Thus we find strongly regular graphs with parameters $(63,32,16,16)$, $(64,36,20,20)$, and $(64,28,12,12)$ for almost all feasible 2-ranks. In addition we work out the behavior of the 2-rank for a graph product related to the Kronecker product for Hadamard matrices, which enables us to find many graphical Hadamard matrices of order $4^m$ for which the number of related strongly regular graphs with different 2-ranks is unbounded as a function of $m$. The paper extends results from the article ‘Switched symplectic graphs and their 2-ranks’ by the first and the last author.     

Approximation of high-dimensional kernel matrices by multilevel circulant matrices

Kernels are important in developing a variety of numerical methods, such as approximation, interpolation, neural networks, machine learning and meshless methods for solving engineering problems. A common problem of these kernel-based methods is to calculate inverses of kernel matrices generated by a kernel function and a set of points. Due to the denseness of these matrices, finding their inverses is computationally costly. To overcome this difficulty, we introduce in this paper an approximation of the kernel matrices by appropriate multilevel circulant matrices so that the fast Fourier transform can be applied to reduce the computational cost. Convergence analysis for the proposed approximation is established based on certain decay properties of the kernels.     

On Circulant Complex Hadamard Matrices

We show that a circulant complex Hadamard matrix of order n is equivalent to a relative difference set in the group C ₄×C _n where the forbidden subgroup is the unique subgroup of order two which is contained in the C ₄ component. We obtain non-existence results for these relative difference sets. Our results are sufficient to prove there are no circulant complex Hadamard matrices for many orders.