Related papers: Adjacency preserving mappings on real symmetric ma…

We characterize maps $\phi_i: \mathcal{S} \to \mathcal{S}$, $i=1, \ldots, m$ and $m\ge 1$, that have the multiplicative spectrum or trace preserving property: \begin{eqnarray*} \textrm{spec} (\phi_1(A_1)\cdots \phi_m(A_m)) &=& \textrm{spec}…

Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…

In this paper we announce a conjecture concerning enumeration of 2n x k n-times persymmetric matrices over F_2 by rank.

Let $U$ and $V$ be finite-dimensional vector spaces over an arbitrary field $\mathbb{K}$, and $\mathcal{S}$ be a linear subspace of the space $\mathcal{L}(U,V)$ of all linear maps from $U$ to $V$. A map $F : \mathcal{S} \rightarrow V$ is…

Let $\mathbb{D}$ be a division ring, and let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency,…

A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…

In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…

Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

We fully describe the general form of a linear (or conjugate-linear) rank metric isometry on the Murray--von Neumann algebra associated with a II$_1$-factor. As an application, we establish Frobenius' theorem in the setting of…

We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

We show that a best rank one approximation to a real symmetric tensor, which in principle can be nonsymmetric, can be chosen symmetric. Furthermore, a symmetric best rank one approximation to a symmetric tensor is unique if the tensor does…

We show that if A_1, A_2, ... , A_n are square matrices, each of them is either unitary or self-adjoint, and they almost commute with respect to the rank metric, then one can find commuting matrices B_1, B_2, ... , B_n that are close to the…

Let $1 \leq k < n$ be integers. Two $n \times n$ matrices $A$ and $B$ form a parallel pair with respect to the $k$-numerical radius $w_k$ if $w_k(A + \mu B) = w_k(A) + w_k(B)$ for some scalar $\mu$ with $|\mu| = 1$; they form a TEA…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…