# A note on the gap between rank and border rank

```@article{Zuiddam2015ANO,
title={A note on the gap between rank and border rank},
author={Jeroen Zuiddam},
journal={ArXiv},
year={2015},
volume={abs/1504.05597}
}```
• Jeroen Zuiddam
• Published 21 April 2015
• Mathematics, Computer Science
• ArXiv
11 Citations

## Tables from this paper

Abelian Tensors
• Mathematics
ArXiv
• 2015
Tensor rank and entanglement of pure quantum states
• Computer Science
• 2019
As entanglement of a given quantum state depends on the way the total system is divided into subsystems, the notion of `partitioning rank' of a tensor is introduced, which depends on a way how the entries forming the tensor are treated.
Algebraic complexity, asymptotic spectra and entanglement polytopes
The first explicit construction of an infinite family of elements in the asymptotic spectrum of complex k-tensors, based on information theory and entanglement polytopes is given, and it is proved that any polynomial can be efficiently approximated by a width-2 abp.
On the partially symmetric rank of tensor products of \$W\$-states and other symmetric tensors
• Mathematics, Computer Science
Rendiconti Lincei - Matematica e Applicazioni
• 2019
It is proved that the partially symmetric rank of the so-called "W-states", namely monomials of the form \$x^{d-1}y\$, and on products of such, is at most \$2-1(d_1+ ... +d_k)\$.
AN ALGORITHMIC METHOD OF PARTIAL DERIVATIVES CORNELIUS BRAND Charles University
This work studies a new complexity measure on the space of homogeneous polynomials, namely the bilinear complexity of a polynomial’s apolar algebra, and matches the runtime of the fastest-known deterministic algorithm for detecting subgraphs of bounded pathwidth while using a new approach.
An Algorithmic Method of Partial Derivatives
• Mathematics, Computer Science
ArXiv
• 2020
A new complexity measure is studied on the space of homogeneous polynomials, namely the bilinear complexity of a polynomial's apolar algebra, which is based on the Waring rank and the exponent of matrix multiplication.
On algebraic branching programs of small width Bringmann
• Mathematics, Computer Science
• 2017
It is proved that the class VNP can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of poynomially many affine linear forms, which gives the first separations of algebraic complexity classes from their nondeterministic analogs.
On Algebraic Branching Programs of Small Width
• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2017
It is proved that the class VPN can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of poynomially many affine linear forms, which gives the first separations of algebraic complexity classes from their nondeterministic analogs.

## References

SHOWING 1-10 OF 36 REFERENCES
On Degeneration of Tensors and Algebras
• Mathematics, Computer Science
MFCS
• 2016
This work describes the smoothable algebra associated to the Coppersmith-Winograd tensor and proves a lower bound for the border rank of the tensor used in the "easy construction" of Coppermith and Winograd.
How hard is the tensor rank
The tensor rank over \$\mathbb{Z}\$ turns out to be undecidable, which answers the question posed by Gonzalez and Ja'Ja' in 1980 and the symmetric rank admits a similar description of computational complexity as the one given for usual rank.
Tensor Rank, Invariants, Inequalities, and Applications
• Mathematics
SIAM J. Matrix Anal. Appl.
• 2013
The invariants of the tensors of rank n are constructed to develop a semialgebraic description of the set of probability distributions that can arise from a simple stochastic model with a hidden variable, a model that is important in phylogenetics and other fields.
Equations for Lower Bounds on Border Rank
• Mathematics, Computer Science
Exp. Math.
• 2013
It is shown that these newly obtained polynomials do not vanish on the matrix multiplication operator M 2, which gives a new proof that the border rank of the multiplication of 2×2 matrices is seven.
Most Tensor Problems Are NP-Hard
• Computer Science, Mathematics
JACM
• 2013
It is proved that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard and how computing the combinatorial hyperdeterminant is NP-, #P-, and VNP-hard.
Stratification of the fourth secant variety of Veronese varieties via the symmetric rank
• Mathematics
• 2013
Abstract. If is a projective non-degenerate variety, the X-rank of a point is defined to be the minimum integer r such that P belongs to the span of r points of X. We describe the complete
Powers of tensors and fast matrix multiplication
A method to analyze the powers of a given trilinear form (a special kind of algebraic construction also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication and obtain the upper bound ω.
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Mathematics, Computer Science
SIAM J. Matrix Anal. Appl.
• 2008
It is argued that the naive approach to this problem is doomed to failure because, unlike matrices, tensors of order 3 or higher can fail to have best rank-r approximations, and a natural way of overcoming the ill-posedness of the low-rank approximation problem is proposed by using weak solutions when true solutions do not exist.
Tensor rank of the tripartite state |W>{sup xn}
• Computer Science
• 2009
It is proven that the rank of |W>{sup x}2 is 7, thus resolving a previously open problem, and an upper bound and a lower bound of this rank are derived.
A Complete Characterization of the Algebras of Minimal Bilinear Complexity
This work characterize all algebras of minimal rank over arbitrary fields, which finally solves an open problem in algebraic complexity theory.