相关论文: Switching operations for Hadamard matrices

We give a classification of {\texttt{e.a.b.}} semistar (and star) operations by defining four different (successively smaller) distinguished classes. Then, using a standard notion of equivalence of semistar (and star) operations to…

We construct two Hadamard matrices of order 764. Both are of Goethals-Seidel type.

We use modular symmetric designs to study the existence of Hadamard matrices modulo certain primes. We solve the $7$-modular and $11$-modular versions of the Hadamard conjecture for all but a finite number of cases. In doing so, we state a…

Efficiently processing basic linear algebra subroutines is of great importance for a wide range of computational problems. In this paper, we consider techniques to implement matrix functions on a quantum computer, which are composed of…

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.

Many interesting families of polynomials are indexed by permutations or related objects, and are defined by applying divided difference operators, modified by polynomials, on some initial base case. The fact that these constructions produce…

A new, two-parameter, nonaffine family of complex Hadamard matrices of order 6 is reported. It interpolates between the two Fourier families, and contains as one-parameter subfamilies the Dita family, a symmetric family and an almost (up to…

A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…

The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions,…

In this paper we, first, characterize hypersurfaces for which their Hadamard product is still a hypersurface. Then we pass to study hypersurfaces and, more generally, varieties which are idempotent under Hadamard powers.

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…

In this paper, one new classes of convex functions which is called MT-convex functions are given. We also establish some Hadamard-type inequalities.

Using the tool of unitary transformations of the extended receiver we perform simple operations with the non-diagonal elements of the initial sender's density matrix after their transferring to the receiver. These operations are following:…

We extend an algebra of Mantaci and Reutenauer, acting on the free associative algebra, to a vector space of operators acting on all graded connected Hopf algebras. These operators are convolution products of certain involutions, which we…

A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in…

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

We give canonical forms of selfadjoint and isometric operators on a complex vector space $U$ with scalar product given by a positive semidefinite Hermitian form, and of Hermitian forms on $U$. For an arbitrary system of semiunitary spaces…

We introduce and study a unital version of shift equivalence for finite square matrices over the nonnegative integers. In contrast to the classical case, we show that unital shift equivalence does not coincide with one-sided eventual…

Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…

A complex Hadamard matrix is a square matrix H with complex entries of absolute value 1 satisfying $HH^*= nI$, where $*$ stands for the Hermitian transpose and I is the identity matrix of order $n$. In this paper, we first determine the…