Related papers: On the enumeration of some D-optimal designs
In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…
Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
In this paper, we obtain some new matrix inequalities involving Hadamard product. Also some Hadamard product inequalities for accretive matrices involving the matrix means, positive unital linear maps and matrix concave functions are…
Inspired by the work of Zhou "On equivalence of maximum additive symmetric rank-distance codes" (2020) based on the paper of Schmidt "Symmetric bilinear forms over finite fields with applications to coding theory" (2015), we investigate the…
We introduce two classes of Hadamard matrices of Goethals-Seidel type and construct many matrices in these classes.
We obtain a complete derived equivalence classification of the cluster-tilted algebras of Dynkin type E. There are 67, 416, 1574 algebras in types E6, E7 and E8 which turn out to fall into 6, 14, 15 derived equivalence classes,…
We investigate pattern-avoiding (0,1)-matrices as generalizations of pattern-avoiding permutations. Our emphasis is on 123-avoiding and 321-avoiding patterns for which we obtain exact results as to the maximum number of 1's such matrices…
We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We…
We introduce mutually unbiased complex Hadamard (MUCH) matrices and show that the number of MUCH matrices of order 2n, n odd, is at most 2 and the bound is attained for n = 1,5,9. Furthermore, we prove that certain pairs of mutually…
For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a…
We construct two Hadamard matrices of order 764. Both are of Goethals-Seidel type.
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…
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…
A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is conjectured that…
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…
Daniel McNulty et.al (2024 J. Phys. A: Math. Theor. submitted) voiced suspicions to the Lemma 11(v) Part 6 in Chen and Yu (2017 J. Phys. A: Math. Theor. 50 475304) and three theorems derived in later publications (Liang et al 2019 Quantum…
It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…
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…
An $n$ by $n$ skew-symmetric type $(-1,1)$-matrix $K=[k_{i,j}]$ has $1$'s on the main diagonal and $\pm 1$'s elsewhere with $k_{i,j}=-k_{j,i}$. The largest possible determinant of such a matrix $K$ is an interesting problem. The literature…