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

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design,…

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…

The Google matrix is a positive, column-stochastic matrix that is used to compute the pagerank of all the web pages on the Internet: the eigenvector corresponding to the eigenvalue 1 is the pagerank vector. Due to its huge dimension, of the…

We say a zero-one matrix $A$ avoids another zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the extremal function $ex(n,P)$, the maximum number of…

In various application fields, tensor type data are used recently and then a typical rank is important. Although there may be more than one typical ranks over the real number field, a generic rank over the complex number field is the…

We study the column subset selection problem with respect to the entrywise $\ell_1$-norm loss. It is known that in the worst case, to obtain a good rank-$k$ approximation to a matrix, one needs an arbitrarily large $n^{\Omega(1)}$ number of…

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…

We calculate the real rank and stable rank of CCR algebras which either have only finite dimensional irreducible representations or have finite topological dimension. We show that either rank of A is determined in a good way by the ranks of…

The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the…

Let $N_1, \ldots, N_d$ be positive integers with $N_1\leq\cdots\leq N_d$. Set $N=N_1\cdots N_{d-1}$. We show in this paper that an integer $r$ is a typical nonnegative rank of nonnegative tensors of format $N_1\times\cdots\times N_d$ if and…

The determination of the maximal ranks of a set of a given type of tensors is a basic problem both in theory and application. In statistical applications, the maximal rank is related to the number of necessary parameters to be built in a…

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

The Theta rank of a finite point configuration $V$ is the maximal degree necessary for a sum-of-squares representation of a non-negative linear function on $V$. This is an important invariant for polynomial optimization that is in general…

We characterize the infimum of a matrix norm of a square matrix A induced by an absolute norm, over the fields of real and complex numbers. Usually this infimum is greater than the spectral radius of A. If A is sign equivalent to a…

If a matrix $A$ has rank $r$, then its row echelon form (from elimination) contains the identity matrix in its first $r$ independent columns. How do we \emph{interpret the matrix} $F$ that appears in the remaining columns of that echelon…

Recently, Brualdi and Cao studied $I_k$-avoiding $(0,1)$-matrices by decomposing them into zigzag paths and proved that the maximum number of $1$'s in such a matrix is given by an exact formula. We further study the structure of maximal…

We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows…

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

The minimum rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph. The current algorithms can compute efficiently the minimum rank of undirected trees. This paper provides an…

It is suggested to insert into test matrix 1s for correct responses, 0s for response refusals, and negative corrective elements for incorrect responses. With the classical test theory approach test scores of examinees and items are…