English
Related papers

Related papers: Exact values of generic subrank

200 papers

We prove border rank bounds for a class of $GL(V)$-invariant tensors in $V^*\otimes U\otimes W$, where $U$ and $W$ are $GL(V)$-modules. These tensors correspond to spaces of matrices of constant rank. In particular we prove lower bounds for…

Algebraic Geometry · Mathematics 2024-05-10 Derek Wu

The analytic rank of a tensor, first defined by Gowers and Wolf in the context of higher-order Fourier analysis, is defined to be the logarithm of the bias of the tensor. We prove that it is a subadditive measure of rank: that is, the…

Combinatorics · Mathematics 2019-06-04 Shachar Lovett

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Computational Complexity · Computer Science 2020-07-07 Pascal Koiran

We study an upper bound of ranks of $n$-tensors with size $2\times\cdots\times2$ over the complex and real number field. We characterize a $2\times 2\times 2$ tensor with rank 3 by using the Cayley's hyperdeterminant and some function. Then…

Rings and Algebras · Mathematics 2013-06-05 Toshio Sumi , Toshio Sakata , Mitsuhiro Miyazaki

In this paper, we define the minimum (maximum) rank, term rank and the sign nonsingular of tensors. The sufficiency and necessity for the minimum rank of a real tensor to be $1$ is given. And we show that the maximum rank of a tensor is not…

Combinatorics · Mathematics 2014-12-24 Changjiang Bu , Wenzhe Wang , Lizhu Sun , Jiang Zhou

This paper describes a flexible framework for generalized low-rank tensor estimation problems that includes many important instances arising from applications in computational imaging, genomics, and network analysis. The proposed estimator…

Statistics Theory · Mathematics 2021-02-08 Rungang Han , Rebecca Willett , Anru R. Zhang

For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing…

Computational Complexity · Computer Science 2013-08-08 J. M. Landsberg

In this paper, we introduce various covering number bounds for linear function classes, each subject to different constraints on input and matrix norms. These bounds are contingent on the rank of each class of matrices. We then apply these…

Machine Learning · Statistics 2024-10-16 Lan V. Truong

A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…

Numerical Analysis · Mathematics 2022-01-20 Alain Franc

We study typical ranks with respect to a real variety $X$. Examples of such are tensor rank ($X$ is the Segre variety) and symmetric tensor rank ($X$ is the Veronese variety). We show that any rank between the minimal typical rank and the…

Algebraic Geometry · Mathematics 2015-12-08 Alessandra Bernardi , Grigoriy Blekherman , Giorgio Ottaviani

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…

Algebraic Geometry · Mathematics 2024-02-21 Arthur Bik , Jan Draisma , Rob Eggermont , Andrew Snowden

We describe the stratification by tensor rank of the points belonging to the tangent developable of any Segre variety. We give algorithms to compute the rank and a decomposition of a tensor belonging to the secant variety of lines of any…

Algebraic Geometry · Mathematics 2013-12-05 Edoardo Ballico , Alessandra Bernardi

This educational article highlights the geometric and algebraic complexities that distinguish tensors from matrices, to supplement coverage in advanced courses on linear algebra, matrix analysis, and tensor decompositions. Using the case of…

Numerical Analysis · Mathematics 2025-04-08 Gabriel H. Brown , Joe Kileel , Tamara G. Kolda

We study the semialgebraic structure of $D_r$, the set of nonnegative tensors of nonnegative rank not more than $r$, and use the results to infer various properties of nonnegative tensor rank. We determine all nonnegative typical ranks for…

Rings and Algebras · Mathematics 2016-08-23 Yang Qi , Pierre Comon , Lek-Heng Lim

The main contribution of this note is to establish a framework to extend results of tensor functions over specific field to general field. As a consequence of this framework, we extend the existing work to more general settings: \emph{(1)}…

Commutative Algebra · Mathematics 2026-03-11 Qiyuan Chen

It has recently been shown that the tensor rank can be strictly submultiplicative under the tensor product, where the tensor product of two tensors is a tensor whose order is the sum of the orders of the two factors. The necessary upper…

Algebraic Geometry · Mathematics 2019-05-02 Matthias Christandl , Fulvio Gesmundo , Asger Kjærulff Jensen

We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…

Algebraic Geometry · Mathematics 2011-11-28 A. Bernardi , A. Gimigliano , M. Idà

We establish an upper bound for the rank of every power of an arbitrary quadratic form. Specifically, for any $s\in\mathbb{N}$, we prove that the $s$-th power of a quadratic form of rank $n$ grows as $n^s$. Furthermore, we demonstrate that…

Algebraic Geometry · Mathematics 2025-01-03 Cosimo Flavi

We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…

Mathematical Physics · Physics 2021-09-21 Damianos Iosifidis

We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…

Data Structures and Algorithms · Computer Science 2025-02-12 Pascal Koiran