Related papers: Constructing cocyclic Hadamard matrices of order 4…
In this paper we describe an algorithm for generating all the possible $PIW(m,n,k)$ - integer $m\times n$ Weighing matrices of weight $k$ up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up…
We consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to…
The intended purpose of this work is to provide the reader with a comprehensive, state-of-the art presentation of the theory of complex Hadamard matrices, or at least report on the very recent advances. This manuscript consists of three…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
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 introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…
Higher order group cohomology is defined and first properties are given. Using modular symbols, an Eichler-Shimura homomorphism is constructed mapping spaces of higher order cusp forms to higher order cohomology groups.
Using the computational approach introduced in [Agore A.L., Bontea C.G., Militaru G., J. Algebra Appl. 12 (2013), 1250227, 24 pages, arXiv:1207.0411] we classify all coalgebra split extensions of $H_4$ by $k[C_n]$, where $C_n$ is the cyclic…
In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…
In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…
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.
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
Local operations of combinatorial structures (graphs, Hadamard matrices, codes, designs) that maintain the basic parameters unaltered, have been widely used in the literature under the name of switching. We show an equivalence between two…
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…
Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…
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…
In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…
In 1989 we proposed to employ Vandermonde and Hankel multipliers to transform into each other the matrix structures of Toeplitz, Hankel, Vandermonde and Cauchy types as a means of extending any successful algorithm for the inversion of…
Following the ideas of [AGG11] about Zt x Z2,2-cocyclic Hadamard matrices, we introduce the notion of diagram, which visually represents any set of coboundaries. Diagrams are a very useful tool for the description and the study of paths and…
A new family of methods involving complex coefficients for the numerical integration of differential equations is presented and analyzed. They are constructed as linear combinations of symmetric-conjugate compositions obtained from a basic…