English
Related papers

Related papers: A Real eigenvector of Circulant matrices and a con…

200 papers

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

Combinatorics · Mathematics 2023-02-17 Joshua Morris

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.

Number Theory · Mathematics 2024-05-24 Luis H. Gallardo

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…

Number Theory · Mathematics 2014-11-11 Luis H. Gallardo

Turyn prove that if a circulant Hadamard matrix of order $n$ exists then $n$ must be of the form $n=4m^{2}$ for some odd integer $m$. In this paper we use the structure constant of Schur ring of $\Z_{2}^{4m^{2}}$ to prove that there is no…

Combinatorics · Mathematics 2018-05-15 Ronald Orozco López

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

Rings and Algebras · Mathematics 2014-02-26 Barry Hurley , Paul Hurley , Ted Hurley

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…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

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…

Combinatorics · Mathematics 2014-09-26 M. Matolcsi

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…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

We study the partial Hadamard matrices $H\in M_{M\times N}(\mathbb C)$ which are regular, in the sense that the scalar products between pairs of distinct rows decompose as sums of cycles (rotated sums of roots of unity). The simplest…

Combinatorics · Mathematics 2017-06-07 Teodor Banica , Lorenzo Pittau

We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard…

Combinatorics · Mathematics 2012-01-04 Mate Matolcsi , Imre Z. Ruzsa , Mihaly Weiner

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…

Combinatorics · Mathematics 2019-04-12 Ronald Orozco López

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…

Combinatorics · Mathematics 2014-12-09 Gaurush Hiranandani , Jean-Marc Schlenker

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…

Combinatorics · Mathematics 2023-06-30 Matteo Cati , Dmitrii V. Pasechnik

An Hadamard matrix is a square matrix $H\in M_N(\pm1)$ whose rows and pairwise orthogonal. More generally, we can talk about the complex Hadamard matrices, which are the square matrices $H\in M_N(\mathbb C)$ whose entries are on the unit…

Combinatorics · Mathematics 2024-07-30 Teo Banica

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…

Number Theory · Mathematics 2014-11-11 Luis H. Gallardo

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…

Combinatorics · Mathematics 2026-05-12 Hadi Kharaghani , Ali Mohammadian , Behruz Tayfeh-Rezaie

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…

Cryptography and Security · Computer Science 2024-11-25 Susanta Samanta

The $N\times N$ complex Hadamard matrices form a real algebraic manifold $C_N$. The singularity at a point $H\in C_N$ is described by a filtration of cones $T^\times_HC_N\subset T^\circ_HC_N\subset T_HC_N\subset\widetilde{T}_HC_N$, coming…

Combinatorics · Mathematics 2015-06-15 Teodor Banica

We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.

Combinatorics · Mathematics 2024-06-18 Luis H. Gallardo , Olivier Rahavandrainy , Reinhardt. Euler

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…

Combinatorics · Mathematics 2021-07-06 Daniel Uzcátegui Contreras , Dardo Goyeneche , Ondřej Turek , Zuzana Václavíková
‹ Prev 1 2 3 10 Next ›