Related papers: On rank-critical matrix spaces

A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…

This note gives an example of closed smooth manifolds $M$ and $N$ for which the rank of $M\times N$ is strictly greater than $rank M + rank N$.

Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…

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

Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some…

Let $A$ be a real matrix. The term rank of $A$ is the smallest number $t$ of lines (that is, rows or columns) needed to cover all the nonzero entries of $A$. We prove a conjecture of Li et al. stating that, if the rank of $A$ exceeds $t-3$,…

Let $H\_0, ..., H\_n$ be $m \times m$ matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals. We consider the linear Hankel matrix $H(\vecx)=H\_0+\X\_1H\_1+...+\X\_nH\_n$ and the problem of computing sample points…

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…

Let V be a linear subspace of M_{n,p}(K) with codimension lesser than n, where K is an arbitrary field and n >=p. In a recent work of the author, it was proven that V is always spanned by its rank p matrices unless n=p=2 and K is isomorphic…

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

Let q be a power of a prime and let V be a vector space of finite dimension n over the field of order q. Let Bil(V) denote the set of all bilinear forms defined on V x V, let Symm(V) denote the subspace of Bil(V) consisting of symmetric…

Given an $m\times n$ binary matrix $M$ with $|M|=p\cdot mn$ (where $|M|$ denotes the number of 1 entries), define the discrepancy of $M$ as $\mbox{disc}(M)=\displaystyle\max_{X\subset [m], Y\subset [n]}\big||M[X\times Y]|-p|X|\cdot…

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

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…

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

We show that the classification problem for genus n Banach spaces can be reduced to the unconditionally primary case and that the critical case there is n=2. It is further shown that a genus n Banach space is unconditionally primary if and…

The article concerns low-rank approximation of matrices generated by sampling a smooth function of two $m$-dimensional variables. We identify several misconceptions surrounding a claim that, for a specific class of analytic functions, such…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free…

Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…