Related papers: Multiplicative derivations on rank-$s$ matrices fo…

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

In this paper, at first the construction of Lie higher derivations and higher derivations on a generalized matrix algebra were characterized; then the conditions under which a Lie higher derivation on generalized matrix algebras is proper…

In this note, we investigate how well we can reconstruct the best rank-$r$ approximation of a large matrix from a small number of its entries. We show that even if a data matrix is of full rank and cannot be approximated well by a low-rank…

Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision. The goal of matrix sensing is to recover a matrix $A_\star \in \mathbb{R}^{n \times n}$, based on a…

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

In this article we construct examples of derivations in matrix semirings. We study hereditary and inner derivations, derivatives of diagonal, triangular, Toeplitz, circulant matrices and of matrices of other forms and prove theorems for…

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…

For a ring $R$ with an automorphism $\sigma$, an $n$-additive mapping $\Delta:R\times R\times... \times R \rightarrow R$ is called a skew $n$-derivation with respect to $\sigma$ if it is always a $\sigma$-derivation of $R$ for each…

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}$,…

We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…

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 establish a one-to-one correspondence between rational multiplicative group actions on an algebraic variety $X$ and derivations $\partial\colon K_X\to K_X$ of the field of fractions $K_X$ of $X$ satisfying that there exists a generating…

This paper is the second in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices with entries belonging to an arbitrary ground field which is large enough. In…

Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…

Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where…

Recognizing when a ring is a complete matrix ring is of significant importance in algebra. It is well-known folklore that a ring $R$ is a complete $n\times n$ matrix ring, so $R\cong M_{n}(S)$ for some ring $S$, if and only if it contains a…