Related papers: Asymptotic rank bounds: a numerical census

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

This is an English translation of the manuscript which appeared in Surikaiseki Kenkyusho Kokyuroku No. 1055 (1998). The asymptotic efficiency of statistical estimate of unknown quantum states is discussed, both in adaptive and collective…

The subrank of tensors is a measure of how much a tensor can be ''diagonalized''. This parameter was introduced by Strassen to study fast matrix multiplication algorithms in algebraic complexity theory and is closely related to many central…

We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

We propose a numerical method to obtain an adequate value for the upper bound on the rank for the tensor completion problem on the variety of third-order tensors of bounded tensor-train rank. The method is inspired by the parametrization of…

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…

In this paper, we develop a geometric framework for matrix rank-metric codes based on generator tensors and their slice spaces. To every nondegenerate matrix rank-metric code, we associate two systems, which translate metric properties of…

Tur\'an type inequalities for modified Bessel functions of the first kind are used to deduce some sharp lower and upper bounds for the asymptotic order parameter of the stochastic Kuramoto model. Moreover, approximation from the Lagrange…

Suppose that we observe entries or, more generally, linear combinations of entries of an unknown $m\times T$-matrix $A$ corrupted by noise. We are particularly interested in the high-dimensional setting where the number $mT$ of unknown…

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…

We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field $\F_q$. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura…

Low-rank tensors appear to be prosperous in many applications. However, the sets of bounded-rank tensors are non-smooth and non-convex algebraic varieties, rendering the low-rank optimization problems to be challenging. To this end, we…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

We examine the sum of modified Bessel functions with argument depending non-linearly on the summation index given by \[S_{\nu,p}(a)=\sum_{n\geq 1} (an^p/2)^{-\nu} K_\nu(an^p)\qquad (a>0,\ 0\leq\nu<1)\] as the parameter $a\to 0+$, where $p$…

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Recently Marcus, Spielman and Srivastava proved Weaver's ${\rm{KS}}_r$ conjecture, which gives a positive solution to the Kadison-Singer problem. Cohen and Br\"and\'en independently extended this result to obtain the arbitrary-rank version…

The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…

We consider the problem of learning low-rank tensors from partial observations with structural constraints, and propose a novel factorization of such tensors, which leads to a simpler optimization problem. The resulting problem is an…

We provide non-asymptotic bounds for first and higher order inclusion probabilities of the rejective sampling model with various size parameters. Further we derive bounds in the semi-definite ordering for matrices that collect (conditional)…