Related papers: On rank-critical matrix spaces

Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…

Let $\mathfrak{M}$ be a class of metric spaces. A metric space $Y$ is minimal $\mathfrak{M}$-universal if every $X\in\mathfrak{M}$ can be isometrically embedded in $Y$ but there are no proper subsets of $Y$ satisfying this property. We find…

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…

The fastest known algorithms for dealing with structured matrices, in the sense of the displacement rank measure, are randomized. For handling classical displacement structures, they achieve the complexity bounds…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a…

In this paper, we introduce and study the notion of phase rank. Given a matrix filled with phases, i.e., with complex entries of modulus $1$, its phase rank is the smallest possible rank for a complex matrix with the same phase, but…

An $n\times n$ matrix $X$ is called completely positive semidefinite (cpsd) if there exist $d\times d$ Hermitian positive semidefinite matrices $\{P_i\}_{i=1}^n$ (for some $d\ge 1$) such that $X_{ij}= {\rm Tr}(P_iP_j),$ for all $i,j \in \{…

The standard definition of the dimension of a vector space or rank of a module states that dimension or rank is equal to the cardinality of any basis, which requires an understanding of the concepts of basis, generating set, and linear…

The notion of fractional minimal rank of a partial matrix is introduced, a quantity that lies between the triangular minimal rank and the minimal rank of a partial matrix. The fractional minimal rank of partial matrices whose bipartite…

A compact space $X$ is said to be minimal if there exists a map $f:X\to X$ such that the forward orbit of any point is dense in $X$. We consider rigid minimal spaces, motivated by recent results of Downarowicz, Snoha, and Tywoniuk [J. Dyn.…

All matrices we consider have entries in a fixed algebraically closed field $K$. A minor of a square matrix is principal means it is defined by the same row and column indices. We study the ideal generated by size $t$ principal minors of a…

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

In this work, we characterize matrices of linear forms and constant rank, demonstrating that, under some natural assumptions, they are always associated with a syzygy bundle that fits into a (partially linear) resolution. Furthermore, this…

We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…

We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…

Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which…

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

We calculate the maximal dimension of linear spaces of symmetric and hermitian matrices with given high rank, generalizing a well-known result of Adams {\em et al.}

Let $M$ be a $n\times m$ $(0,1)$-matrix. We define the $s$-binary rank, $br_s(M)$, of $M$ to be the minimal integer $d$ such that there are $d$ monochromatic rectangles that cover all the $1$-entries in the matrix, and each $1$-entry is…