Related papers: Condition for the higher rank numerical range to b…

We show that the set of all possible constant diagonals of a bounded Hilbert space operator is always convex. This, in particular, answers an open question of J.-C. Bourin ($2003$). Moreover, we show that the joint numerical range of a…

We partially prove a conjecture from [MkSh:366] which says that the spectrum of almost free, essentially free, non-free algebras in a variety is either empty or consists of the class of all successor cardinals.

Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

In this paper we give an alternative proof that the family of matrices studied by Daeshik Choi in A proof of Crouzeix's conjecture for a class of matrices, Linear Algebra and its Applications, 438, no. 8 (2013), pp. 3247-3257, satisfy…

Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…

For any $n\geq k\geq l\in\mathbb{N},$ let $S(n,k,l)$ be the set of all those non-negative definite matrices $a\in M_{n}(\mathbb{C})$ with $l\leq\text{rank }a\leq k$. Motivated by applications to $C^{*}$-algebra theory, we investigate the…

Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em…

Let ${\mathcal B}({\mathcal H})$ be the algebra of all bounded linear operators on the Hilbert space ${\mathcal H}$. For a positive integer $k$ less than the dimension of ${\mathcal H}$ and ${\mathbf A} = (A_1, \dots, A_m)\in {\mathcal…

The famous Hanna Neumann Conjecture (now the Friedman-Mineyev theorem) gives an upper bound for the ranks of the intersection of arbitrary subgroups $H$ and $K$ of a non-abelian free group. It is an interesting question to `quantify' this…

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Let V be a rank N vector bundle on a d-dimensional complex projective scheme X; assume that V is equipped with a quadratic form with values in a line bundle L and that S^2 V^* \otimes L is ample. Suppose that the maximum rank of the…

An $n$-list $\lambda:=\left(r; \lambda_2, \ldots, \lambda_n\right)$ of complex numbers with $r>0,$ is said to be realizable if $\lambda$ is the spectrum of $n\times n$ nonnegative matrix $A$ and in this case $A$ is said to be a nonnegative…

Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…

Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…

In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a…