Related papers: Some Constructions for Amicable Orthogonal Designs
We describe a construction of three-dimensional Hadamard matrices of even order $v$ such that $v-1$ is a prime power. The construction covers infinitely many orders for which the existence was previously open.
Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…
Self-dual codes have been studied actively because they are connected with mathematical structures including block designs and lattices and have practical applications in quantum error-correcting codes and secret sharing schemes.…
Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…
In an order-of-addition experiment, each treatment is a permutation of m components. It is often unaffordable to test all the m! treatments, and the design problem arises. We consider a model that incorporates the order of each pair of…
Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares composition formula) have a long history. Adams et al. (2011)…
A $Cretan(4t+1)$ matrix, of order $4t+1$, is an orthogonal matrix whose elements have moduli $\leq 1$. The only $Cretan(4t+1)$ matrices previously published are for orders 5, 9, 13, 17 and 37. This paper gives infinitely many new…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
Recently, Zhang et al [Phys. Rev. A 92, 012332 (2015)] presented $4d-4$ orthogonal product states that are locally indistinguishable and completable in a $d\otimes d$ quantum system. Later, Zhang et al. [arXiv: 1509.01814v2 (2015)]…
Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show…
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…
We study intertwining relations for $n\times n$ matrix non-Hermitian, in general, one-dimensional Hamiltonians by $n\times n$ matrix linear differential operators with nondegenerate coefficients at $d/dx$ in the highest degree. Some methods…
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…
Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A…
A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
Explicit algorithms are developed for constructing odd order n pandiagonal latin cubes in 3 and 4 dimensions, and these are used to construct pandiagonal magic cubes and 4 dimensional hypercubes, respectively. It is established that these…
A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…
We develop the concept of a unitary t-design as a means of expressing operationally useful subsets of the stochastic properties of the uniform (Haar) measure on the unitary group U(2^n) on n qubits. In particular, sets of unitaries forming…