Border rank non-additivity for higher order tensors

07/10/2020
by   Matthias Christandl, et al.
0

Whereas matrix rank is additive under direct sum, in 1981 Schönhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive for higher order tensors has remained open. In this work, we settle this problem by providing analogs of Schönhage's construction for tensors of order four and higher. Schönhage's work was motivated by the study of the computational complexity of matrix multiplication; we discuss implications of our results for the asymptotic rank of higher order generalizations of the matrix multiplication tensor.

READ FULL TEXT
research
04/03/2020

Tensor Rank and Complexity

These lecture notes are intended as an introduction to several notions o...
research
09/22/2017

Universal points in the asymptotic spectrum of tensors

The asymptotic restriction problem for tensors is to decide, given tenso...
research
09/03/2018

Tensor Networks for Latent Variable Analysis: Higher Order Canonical Polyadic Decomposition

The Canonical Polyadic decomposition (CPD) is a convenient and intuitive...
research
12/19/2019

Hyperpfaffians and Geometric Complexity Theory

The hyperpfaffian polynomial was introduced by Barvinok in 1995 as a nat...
research
04/16/2022

Cannikin's Law in Tensor Modeling: A Rank Study for Entanglement and Separability in Tensor Complexity and Model Capacity

This study clarifies the proper criteria to assess the modeling capacity...
research
02/15/2020

Higher order co-occurrence tensors for hypergraphs via face-splitting

A popular trick for computing a pairwise co-occurrence matrix is the pro...
research
10/28/2020

papaya2: 2D Irreducible Minkowski Tensor computation

A common challenge in scientific and technical domains is the quantitati...

Please sign up or login with your details

Forgot password? Click here to reset