Related papers: Some new symmetric Hadamard matrices
We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…
In this study, the author establish some inequalities of Hadamard like based on convex and s-convexity in the second sense. Some applications to special means of positive real numbers are also given.
In this paper we achieve some new Hadamard type inequalities using elementary well known inequalities for functions whose first derivatives absolute values are s-geometrically and geometrically convex. And also we get some applications for…
We show that naturally associated to a SIC (symmetric informationally complete positive operator valued measure or SIC-POVM) in dimension d there are a number of higher dimensional structures: specifically a projector and a complex Hadamard…
We present a symbolic decomposition of the Pearson chi-square statistic with unequal cell probabilities, by presenting Hadamard-type matrices whose columns are eigenvectors of the variance-covariance matrix of the cell counts. All of the…
The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…
We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots of unity and the algebra of split quaternions over the real…
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…
The concept of matrix rigidity was introduced by Valiant(independently by Grigoriev) in the context of computing linear transformations. A matrix is rigid if it is far(in terms of Hamming distance) from any matrix of low rank. Although we…
Every Hadamard matrix $H$ of order $n > 1$ induces a graph with $4n$ vertices, called the Hadamard graph $\Gamma(H)$ of $H$. Since $\Gamma(H)$ is a distance-regular graph with diameter $4$, it induces a $4$-class association scheme…
Applications in quantum information theory and quantum tomography have raised current interest in complex Hadamard matrices. In this note we investigate the connection between tiling Abelian groups and constructions of complex Hadamard…
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
It is already known that the Ces\`{a}ro matrices of orders one and two are coposinormal, hyponormal operators on $\ell^2$. Here it is shown that the Ces\`{a}ro matrices of order three and four are also coposinormal, hyponormal; the proofs…
In this paper, we analyze the process of "assembling" new matrix geometric means from existing ones, through function composition or limit processes. We show that for n=4 a new matrix mean exists which is simpler to compute than the…
In this paper we introduce a switching for 2-designs. We illustrate this method by applying it to some symmetric (64,28,12) designs. In that way we obtain six new symmetric (64,28,12) designs. Further, we show that this type of switching…
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…
The Mn-matrix was defined by Mohan [20] in which he has shown a method of constructing (1,-1)-matrices and studied some of their properties. The (1,-1)-matrices were constructed and studied by Cohn [5],Wang [33], Ehrlich [8] and Ehrlich and…
We introduce two classes of Hadamard matrices of Goethals-Seidel type and construct many matrices in these classes.
Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…