相关论文: An Approximation to Proof of the Circulant Hadamar…

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

It is shown that if $H$ is a circulant Hadamard $4n\ti 4n $ then $n=1$. This proves the Hadamard circulant conjecture.

We prove that there is no circulant Hadamard matrix $H$ with first row $[h_{1},\ldots,h_{n}]$ of order $n>4$, under a condition about a sum of scalar products of rows of two other circulant matrices of size $n/2$ associated to $H.$

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

For every positive integer $k$ such that $k>1,$ there are an infinity of odd integers $h$ with $\omega(h) =k$ distinct prime divisors such that there do not exist a Circulant Hadamard matrix $H$ of order $n=4h^2.$ Moreover, our main result…

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.

We describe an approach to the circulant Hadamard conjecture based on Walsh-Fourier analysis. We show that the existence of a circulant Hadamard matrix of order $n$ is equivalent to the existence of a non-trivial solution of a certain…

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 a variety of issues are discussed, Schur ring, $S$-sets, circulant orbits, decimation operator and Hadamard matrices and their relation between them is shown. Firstly we define the complete $S$-sets. Next, we study the…

In this article, we consider a special class of Williamson type matrices which we call them near Williamson matrices. They are in fact four $n\times n$ $(-1, 1)$-matrices $A, B, C, D$ so that $A$ is circulant, $B,C,D$ are symmetric…

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…

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…

In this paper the circulant Hadamard conjecture is proved.

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,…

Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…

We proved recently (see \cite{lhgarasu}) the result on the title for odd prime divisors of such an $n.$ The result implies for many $n's$, more precisely, for an infinity of $n$'s with an arbitrary fixed number of prime divisors, the…

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…

A circulant weighing matrix $W = (w_{i,j})$ is a square matrix of order $n$ and entries $w_{i,j}$ in $\{0, \pm 1\}$ such that $WW^T=kI_n$. In his thesis, Strassler gave a table of existence results for such matrices with $n \leq 200$ and $k…

We study the circulant complex Hadamard matrices of order $n$ whose entries are $l$-th roots of unity. For $n=l$ prime we prove that the only such matrix, up to equivalence, is the Fourier matrix, while for $n=p+q,l=pq$ with $p,q$ distinct…

It is known that a real symmetric circulant matrix with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and orthogonal rows exists only of order $2d+2$ (and trivially of order $1$) [Turek and Goyeneche 2019]. In this paper we…