Related papers: Lines of full rank matrices in large subspaces

Let $\mathcal H$ be a complex Hilbert space and $\mathcal F_s (\mathcal H)$ the real vector space of all self-adjoint finite rank bounded operators on $\mathcal H$. We generalize the famous Wigner's theorem by characterizing linear maps on…

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…

An algebra $S$ is called a Skolem-Noether algebra (SN algebra for short) if for every central simple algebra $R$, every homomorphism $R\to R\otimes S$ extends to an inner automorphism of $R\otimes S$. One of the important properties of such…

We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace algorithm using about…

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

For an integer $n>2$, a rank-$n$ matroid is called an $n$-spike if it consists of $n$ three-point lines through a common point such that, for all $k\in\{1, 2, ..., n - 1\}$, the union of every set of $k$ of these lines has rank $k+1$.…

A $P$-space is a topological space whose every $G_{\delta}$-set is open. In this article, basic properties of $P$-spaces are investigated in the absence of the Axiom of Choice. New weaker forms of the Axiom of Choice, all relevant to…

Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$ there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having polynomial-time…

In the low-rank matrix completion (LRMC) problem, the low-rank assumption means that the columns (or rows) of the matrix to be completed are points on a low-dimensional linear algebraic variety. This paper extends this thinking to cases…

Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume…

In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and…

A variety $X$ is covered by lines if there exist a finite number of lines contained in $X$ passing through each general point. I prove two theorems. Theorem 1:Let $X^n\subset P^M$ be a variety covered by lines. Then there are at most $n!$…

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

If $E=\{e_i\}$ and $F=\{f_i\}$ are two 1-unconditional basic sequences in $L_1$ with $E$ $r$-concave and $F$ $p$-convex, for some $1\le r<p\le 2$, then the space of matrices $\{a_{i,j}\}$ with norm $\|\{a_{i,j}\}\|_{E(F)}=\big\|\sum_k…

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…

In the short note we prove that for every $0<p<1$, there exists an infinite dimensional closed linear subspace of $\mathcal{L}\left( \ell_{p};\ell_{p}\right) $ every nonzero element of which is non $(r,s)$-absolutely summing operator for…

Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic…

If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct…

We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In…

Let $H$ be a complex Hilbert space whose dimension is not less than $3$ and let ${\mathcal F}_{s}(H)$ be the real vector space formed by all self-adjoint operators of finite rank on $H$. For every non-zero natural $k<\dim H$ we denote by…