Related papers: Implementing Hadamard Matrices in SageMath
Assume that $H$ is a circulant Hadamard matrix of order $n\geq 4$. We consider an appropriate stochastic matrix $S$ of order $n$ depending on $H$. This allows us to prove that $n = 4$. Thus, there are only $10$ circulant Hadamard matrices.
In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard matrices modulo 5. We prove that there exist 5-modular Hadamard matrices of order n if and only if n != 3, 7 (mod 10) or n != 6, 11. In…
A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…
We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…
A $\{1,-1\}$-matrix $H$ of order $m$ is a Hadamard matrix if $HH^T=mI_m$, where $T$ is the transposition operator and $I_m$ the identity matrix of order $m$. J. Hadamard published his paper on Hadamard matrices in 1893. Five years later,…
First examples of symmetric Hadamard matrices of orders 508 and 764 are constructed. The method used is known as the propus construction. A conjecture regarding this method is formally proposed but it appears implicitly in three previous…
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…
The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N>=4 admits an affine orbit. This settles a recent open problem…
The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash functions. As a result, numerous matrix structures, including Hadamard and circulant matrices, have…
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…
Let $n$ be the order of a (quaternary) Hadamard matrix. It is shown that the existence of a projective plane of order $n$ is equivalent to the existence of a balancedly multi-splittable (quaternary) Hadamard matrix of order $n^2$.
We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.
Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study…
In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…
A complex Hadamard matrix is a square matrix H with complex entries of absolute value 1 satisfying $HH^*= nI$, where $*$ stands for the Hermitian transpose and I is the identity matrix of order $n$. In this paper, we first determine the…
A complex Hadamard matrix is a square matrix W with complex entries of absolute value 1 satisfying WW*=nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we give constructions of complex…
Cretan matrices are orthogonal matrices with elements $\leq 1$. These may have application in forming some new materials. There is a search for Cretan matrices, especially with high determinant, for all orders. These have been found by both…
We systematically explore the new method of construction (known as the propus construction) of symmetric Hadamard matrices for small orders, $4v$. In particular we give the first examples of symmetric Hadamard matrices of order $156=4\cdot…
Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct…
We use modular symmetric designs to study the existence of Hadamard matrices modulo certain primes. We solve the $7$-modular and $11$-modular versions of the Hadamard conjecture for all but a finite number of cases. In doing so, we state a…