Related papers: Three-dimensional Hadamard matrices of Paley type

In this paper we, first, characterize hypersurfaces for which their Hadamard product is still a hypersurface. Then we pass to study hypersurfaces and, more generally, varieties which are idempotent under Hadamard powers.

Using reversible Hadamard difference sets, we construct symmetric Bush-type Hadamard matrices of order $4m^4$ for all odd integer $m$.

Cocyclic Hadamard matrices (CHMs) were introduced by de Launey and Horadam as a class of Hadamard matrices with interesting algebraic properties. \'O Cath\'ain and R\"oder described a classification algorithm for CHMs of order $4n$ based on…

Positivity properties of the Hadamard powers of the matrix $\begin{bmatrix}1+x_ix_j\end{bmatrix}$ for distinct positive real numbers $x_1,\ldots,x_n$ and the matrix $\begin{bmatrix}|\cos((i-j)\pi/n)|\end{bmatrix}$ are studied. In…

We construct models, by three-dimensional arrays of ccc posets, where many classical cardinal characteristics of the continuum are pairwise different.

In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and…

Let o be a 4k-length column vector whose all entries are 1s, with k a positive integer. Let V={v_i} be a set of semi-normalized Hadamard (SH)-vectors, which are 4k-length vectors whose 2k entries are -1s and the remaining 2k are 1s. We…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

In this paper we construct exponentionally many non-isomorphic skew Hadamard difference sets over an elementary abelian group of order $q^3$.

Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…

Complex Hadamard matrices have received considerable attention in the past few years due to their appearance in quantum information theory. While a complete characterization is currently available only up to order 5 (in \cite{haagerup}),…

We construct new pairs of orthogonal maximal abelian $*$-subalgebras of $M_6(\mathbb C)$, by classifying all self-adjoint complex Hadamard matrices of order 6. In particular, we exhibit a non-affine one-parameter family of non-equivalent…

In this paper we classify complex Hadamard matrices contained in the Bose-Mesner algebra of nonsymmetric 3-class association schemes. As a consequence of our classification, we have two infinite families and some small examples of complex…

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…

The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…

We show that 138 odd values of n less than 10000 for which one knows how to construct a Hadamard matrix of order 4n have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n, namely 191, 5767,…

We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For…

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 discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…

We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…