相关论文: On the Density of the Set of Known Hadamard Orders

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.

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…

By an old result of Cohn (1965), a Hadamard matrix of order n has no proper Hadamard submatrices of order m > n/2. We generalise this result to maximal determinant submatrices of Hadamard matrices, and show that an interval of length…

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

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…

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…

It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix…

We construct Hadamard matrices of orders 4x251 = 1004 and 4x631 = 2524, and skew-Hadamard matrices of orders 4x213 = 852 and 4x631 = 2524. As far as we know, such matrices have not been constructed previously. The constructions use the…

A notable difference between the ordinary and Hadamard products is that the Hadamard product of two singular positive semidefinite matrices can be nonsingular, and one of the factors can even be indefinite. We present an eigenvalue lower…

We prove a conjecture due to Wanless about the permanent of Hadamard matrices in the particular case of Sylvester-Hadamard matrices. Namely we show that for all n greater or equal to 2, the dyadic valuation of the permanent of the…

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…

Let $\|x\|$ denote the distance from $x\in\mathbb{R}$ to the nearest integer. In this paper, we prove an existence and density statement for matrices $\boldsymbol{A}\in\mathbb{R}^{m\times n}$ satisfying…

Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…

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…

Using the ideas of concatenation construction of codes over the $q$-ary alphabet, we modify the known generalized Sylvester-type construction of the Hadamard matrices. The new construction is based on two collections of the Hadamard…

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$.

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$.

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.