Related papers: Hadamard matrices related to the projective planes
Our main result is the construction of symmetric Hadamard matrices of order q(1 + q) where q is a prime power congruent to 3 mod 8.
Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…
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…
We characterize matrices whose powers coincide with their Hadamard powers.
In this paper we present new Hadamard matrices and related combinatorial structures. In particular, it is constructed 5202 inequivalent Hadamard matrices of order 36 as well as 180538 Hadamard symmetric designs with 35 points in addition to…
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…
We construct two Hadamard matrices of order 764. Both are of Goethals-Seidel type.
We give details of a formerly known relation between ternary quadratic forms and quaternion orders through the even Clifford algebra. Based on this and classifications of ternary quadratic forms we give a completely explicit classification…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
In this paper we provide an analytical procedure which leads to a system of $(n-2)^2$ polynomial equations whose solutions give the parameterisation of the complex $n\times n$ Hadamard matrices. It is shown that in general the Hadamard…
The notion of type of quadruples of rows is proven to be useful in the classification of Hadamard matrices. In this paper, we investigate Hadamard matrices with few distinct types. Among other results, the Sylvester Hadamard matrices are…
One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices over ${\mathbb Z} _t \times {\mathbb Z}_2^2$. Two types of equivalence relations for classifying cocyclic matrices…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
Recently, the authors of the present work (together with M. N. Kolountzakis) introduced a new version of the non-commutative Delsarte scheme and applied it to the problem of mutually unbiased bases. Here we use this method to investigate…
We construct many symmetric Hadamard matrices of small order by using the so called propus construction. The necessary difference families are constructed by restricting the search to the families which admit a nontrivial multiplier. Our…
We define quantum automorphisms and isomorphisms of Hadamard matrices. We show that every Hadamard matrix of size $N\ge 4$ has quantum symmetries and that all Hadamard matrices of a fixed size are mutually quantum isomorphic. These results…
We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…
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 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…
We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\times C_2$, where $C_2=\langle u\rangle$ or the same, as a cocyclic Hadamard code. We compute the rank…