Related papers: Real Schur norms and Hadamard matrices
A Butson Hadamard matrix $H$ has entries in the kth roots of unity, and satisfies the matrix equation $HH^{\ast} = nI_{n}$. We write $\mathrm{BH}(n, k)$ for the set of such matrices. A complete morphism of Butson matrices is a map…
We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…
We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…
The component-wise or Schur product $C*C'$ of two linear error correcting codes $C$ and $C'$ over certain finite field is the linear code spanned by all component-wise products of a codeword in $C$ with a codeword in $C'$. When $C=C'$, we…
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…
We prove that the class of GUM matrices is the largest class of bi-potential matrices stable under Hadamard increasing functions. We also show that any power greater than 1, in the sense of Hadamard functions, of an inverse M-matrix is also…
We consider a special symmetric matrix and obtain a similar formula as the one obtained by Weyl's criterion. Some applications of the formula are given, where we give a new way to calculate the integral of $\ln\Gamma(x)$ on $[0,1]$, and we…
In this paper, we study the class of relatively $D$-stable matrices and provide the conditions, sufficient for relative $D$-stability. We generalize the well-known Hadamard inequality, to provide upper bounds for the determinants of…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
A notable difference between the ordinary and Hadamard products is that the Hadamard product of two singular positive semidefinite matrices can be nonsingular, and one of the factors can even be indefinite. We present an eigenvalue lower…
We propose a method for the spectral analysis of unbounded operator matrices in a general setting which fully abstains from standard perturbative arguments. Rather than requiring the matrix to act in a Hilbert space $\mathcal{H}$, we extend…
The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash functions. As a result, numerous matrix structures, including Hadamard and circulant matrices, have…
This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…
We give a new characterisation of inner product spaces amongst normed vector spaces in terms of the maximal cirumradius of spheres. It turns out that a normed vector space $(X,\norm{\cdot})$ with $\dim X\geq 2$ is an inner product space if…
Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B =…
We give necessary and sufficient conditions for a Schur map to be a homomorphism, with some generalizations to the infinite-dimensional case. In the finite-dimensional case, we find that a Schur multiplier distributes over matrix…
Randomized Hadamard Transforms (RHTs) have emerged as a computationally efficient alternative to the use of dense unstructured random matrices across a range of domains in computer science and machine learning. For several applications such…
We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…
With the goal of providing the foundations for a rigorous study of modules of bicomplex holomorphic functions, we develop a general theory of functional analysis with bicomplex scalars. Even though the basic properties of bicomplex number…
Matrix norms can be used to measure the "distance" between two matrices which translates naturally to the problem of calculating the unitary deviation of the neutrino mixing matrices. Variety of matrix norms opens a possibility to measure…