相关论文: On quaternary complex Hadamard matrices of small o…

The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of the same type, in a way that some key property is preserved.…

While convolution and self-attention mechanisms have dominated architectural design in deep learning, this survey examines a fundamental yet understudied primitive: the Hadamard product. Despite its widespread implementation across various…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

In this article, a series of Hadamard matrix has been developed using some block matrices with the help of skew Hadamard matrix. Basically an internal structure of skew Hadamard matrix has been changed with some block matrices using…

We define several operations that switch substructures of Hadamard matrices thereby producing new, generally inequivalent, Hadamard matrices. These operations have application to the enumeration and classification of Hadamard matrices. To…

In this paper, we give several matrix representations for the Horadam quaternions. We derive several identities related to these quaternions by using the matrix method. Since quaternion multiplication is not commutative, some of our results…

In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to device new quantum algorithms. We show how the properties of a weighing matrix can be used to construct…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex…

We consider Hadamard fractional derivatives and integrals of variable fractional order. A new type of fractional operator, which we call the Hadamard-Marchaud fractional derivative, is also considered. The objective is to represent these…

The circulant real and complex matrices are used to find new real and complex conference matrices. With them we construct Sylvester inverse orthogonal matrices by doubling the size of inverse complex conference matrices. When the free…

We will show that in a space of dimension $m$, any family of $2^{m-1}$ distinct Hadamard vectors (where you can choose x or -x but not both) can be partitioned into Hadamard matrices if and only if $m=2^n$ for some n. We will solve this…

We construct Hadamard matrices of orders 4x251 = 1004 and 4x631 = 2524, and skew-Hadamard matrices of orders 4x213 = 852 and 4x631 = 2524. As far as we know, such matrices have not been constructed previously. The constructions use the…

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…

We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…

Many algorithms have been developed for enumerating various combinatorial objects in time exponentially less than the number of objects. Two common classes of algorithms are dynamic programming and the transfer matrix method. This paper…

We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be…

Cretan matrices are orthogonal matrices with elements $\leq 1$. These may have application in forming some new materials. There is a search for Cretan matrices, especially with high determinant, for all orders. These have been found by both…

This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…

Data-driven approaches are particularly useful for computational materials discovery and design as they can be used for rapidly screening over a very large number of materials, thus suggesting lead candidates for further in-depth…