Related papers: On the t-Term Rank of a Matrix

We initiate the study of the binary and Boolean rank of $0,1$ matrices that have a small rank over the reals. The relationship between these three rank functions is an important open question, and here we prove that when the real rank $d$…

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices…

A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…

Over the years, numerous rank estimators for factor models have been proposed in the literature. This article focuses on information criterion-based rank estimators and investigates their consistency in rank selection. The gap conditions…

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

We provide an example of a $21\times 21$ matrix with nonnegative integer entries which can be written as a sum of $19$ nonnegative rank-one matrices but not as a sum of $19$ rational nonnegative rank-one matrices. This gives a solution for…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

We exhibit, for each even degree, a ternary form of rank strictly greater than the maximum rank of monomials. Together with an earlier result in the odd case, this gives the lower bound…

The {\em line sum optimization problem} asks for a $(0,1)$-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column…

In this paper the sum of an orthogonal matrix and an outer product is studied, and a relation between the norms of the vectors forming the outer product and the singular values of the resulting matrix is presented. The main result may be…

A lattice path inside the $m\times n$ table $T$ is a sequence $\nu_1,\ldots,\nu_k$ of cells such that $\nu_{j+1}-\nu_j\in\{(1,-1),(1,0),(1,1)\}$ for all $j=1,\ldots,k-1$. The number of lattice paths in $T$ from the first column to the…

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion…

In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$…

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

We show that the slice rank of the direct sum of two tensors is equal to the sum of their slice ranks. The upper bound is trivial, but the lower bound needs more than a one-line proof, for reasons we explain. This result generalizes the…

We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the…

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

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. A reduced graph $G$ is said to be maximal if any reduced…