Related papers: Lines of full rank matrices in large subspaces

We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…

We consider supervised learning problems within the positive-definite kernel framework, such as kernel ridge regression, kernel logistic regression or the support vector machine. With kernels leading to infinite-dimensional feature spaces,…

Let K be a (commutative) field with characteristic not 2, and V be a linear subspace of n by n matrices that have at most two eigenvalues in K (respectively, at most one non-zero eigenvalue in K). We prove that the dimension of V is less…

For $0<p<1,$ we prove that there is a $\mathfrak{c}$-dimensional subspace of $\mathcal{L}\left( \ell_{p},\ell_{p}\right) $ such that, except for the null vector, all of its vectors fail to be absolutely $(r,s)$-summing regardless of the…

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems…

We present a new proof of the well known formula for the rank of the inclusion matrix by constructing a $k\mathcal{S}_n$-module spanned by the columns of this matrix and calculating its dimension.

In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…

For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some…

Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem…

A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…

The paper contains three results, the common feature of which is that they deal with the Schatten $p$ class. The first is a presentation of a new complemented subspace of $C_p$ in the reflexive range (and $p\not= 2$). This construction…

Under the action of the general linear group with tensor structure, the ranks of matrices $A$ and $B$ forming an $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, with every pencil one can associate a…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good…

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

A celebrated theorem of Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number $p$, we prove that there is an…

Let $f\colon X\to Y$ be a perfect map between finite-dimensional metrizable spaces and $p\geq 1$. It is shown that the space $C^*(X,\R^p)$ of all bounded maps from $X$ into $\R^p$ with the source limitation topology contains a dense…

Let A be a unital simple direct limit of recursive subhomogeneous C*-algebras with no dimension growth. We give criteria which specify exactly when A has real rank zero, and exactly when A has the Property (SP): every nonzero hereditary…