Related papers: Real matrices whose columns have equal modulus coo…

We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no…

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Let $(F,\le)$ be an ordered field and let $A,B$ be square matrices over $F$ of the same size. We say that $A$ and $B$ belong to the same archimedean class if there exists an integer $r$ such that the matrices $r A^T A-B^T B$ and $r B^T…

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…

The lattice cell in the ${i+1}^{st}$ row and ${j+1}^{st}$ column of the positive quadrant of the plane is denoted $(i,j)$. If $\mu$ is a partition of $n+1$, we denote by $\mu/ij$ the diagram obtained by removing the cell $(i,j)$ from the…

We characterize matrices whose powers coincide with their Hadamard powers.

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…

In this article, we consider a special class of Williamson type matrices which we call them near Williamson matrices. They are in fact four $n\times n$ $(-1, 1)$-matrices $A, B, C, D$ so that $A$ is circulant, $B,C,D$ are symmetric…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…

The complete classification of $6\times 6$ complex Hadamard matrices (CHMs) is a long-standing open problem. In this paper we investigate a series of CHMs, such as the CHMs containing a $2\times 3$ submatrix with rank one, the CHMs…

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

Let $\mathfrak{M}_n$ be the multiplicative monoid of $n \times n$ matrices over a finite field. The monoid algebra $\mathbf{C}[\mathfrak{M}_n]$ has been studied for several decades. One of the important early results is Kov\'acs' theorem…

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…

We describe all linear operators which maps $n-1$-dimensional simplex of idempotent measures to itself. Such operators divided to two classes: the first class contains all $n\times n$-matrices with non-negative entries which has at least…

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…