Related papers: Some new symmetric Hadamard matrices
In the present paper we establish some new integral inequalities analogous to the well known Hadamard inequality by using a fairly elementary analysis.
We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Kochen-Specker theorem. We show that the recently discovered…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
Periodic Golay pairs are a generalization of ordinary Golay pairs. They can be used to construct Hadamard matrices. A positive integer $v$ is a (periodic) Golay number if there exists a (periodic) Golay pair of length $v$. Taking into the…
The enumeration of diagonally symmetric alternating sign matrices (DSASMs) is studied, and a Pfaffian formula is obtained for the number of DSASMs of any fixed size, where the entries for the Pfaffian are positive integers given by simple…
It is shown that if $H$ is a circulant Hadamard $4n\ti 4n $ then $n=1$. This proves the Hadamard circulant conjecture.
A new class of harmonic Hadamard manifolds, those spaces called of hypergeometric type, is defined in terms of Gauss hypergeometric equations. Spherical Fourier transform defined on a harmonic Hadamard manifold of hypergeometric type admits…
We discuss the ADHMN construction for SU(N) monopoles and show that a particular simplification arises in studying charge N-1 monopoles with minimal symmetry breaking. Using this we construct families of tetrahedrally symmetric SU(4) and…
Maximum distance separable (MDS) matrices play a crucial role not only in coding theory but also in the design of block ciphers and hash functions. Of particular interest are involutory MDS matrices, which facilitate the use of a single…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
A diagonally symmetric alternating sign matrix (DSASM) is a symmetric matrix with entries $-1$, $0$ and $1$, where the nonzero entries alternate in sign along each row and column, and the sum of the entries in each row and column equals…
We prove existence and convergence of sequences generated by the proximal point method and its two variants for monotone vector fields in Hadamard spaces. Before obtaining our results, we investigate some fundamental properties of tangent…
In this paper, we find regular or biregular Hadamard matrices with maximum excess by negating some rows and columns of known Hadamard matrices obtained from quadratic residues of finite fields. In particular, we show that if either…
Harmonic frames of prime order are investigated. The primary focus is the enumeration of inequivalent harmonic frames, with the exact number given by a recursive formula. The key to this result is a one-to-one correspondence developed…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
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…
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.
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three…
What is the dimension of a smooth family of complex Hadamard matrices including the Fourier matrix? We address this problem with a power series expansion. Studying all dimensions up to 100 we find that the first order result is misleading…